freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-97-large-non-mersenne-prime.md

---
id: 5900f3ce1000cf542c50fee0
challengeType: 5
title: 'Problem 97: Large non-Mersenne prime'
forumTopicId: 302214
---

## Description
<section id='description'>

The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2<sup>6972593</sup>−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2<sup><var>p</var></sup>−1, have been found which contain more digits.

However, in 2004 there was found a massive non-Mersenne prime which contains 2,357,207 digits: 28433×2<sup>7830457</sup>+1.

Find the last ten digits of this prime number.

</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>lrgNonMersennePrime()</code> should return a number.
    testString: assert(typeof lrgNonMersennePrime() === 'number');
  - text: <code>lrgNonMersennePrime()</code> should return 8739992577.
    testString: assert.strictEqual(lrgNonMersennePrime(), 8739992577);

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function lrgNonMersennePrime() {

  return true;
}

lrgNonMersennePrime();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```

</section>