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

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

## 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 26972593−1; it contains exactly 2,098,960 digits. Subsequently other Mersenne primes, of the form 2p−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×27830457+1.
Find the last ten digits of this prime number.
</section>

## Instructions
<section id='instructions'>

</section>

## Tests
<section id='tests'>

```yml
tests:
  - text: <code>euler97()</code> should return 8739992577.
    testString: assert.strictEqual(euler97(), 8739992577, '<code>euler97()</code> should return 8739992577.');

```

</section>

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

<div id='js-seed'>

```js
function euler97() {
  // Good luck!
  return true;
}

euler97();
```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>