Mersenne Primes: The Celebrity Primes
Primes of the form 2ⁿ − 1 are rare, enormous, and famous. They've been hunted for four centuries — and the search is still on.
In the world of prime numbers, most primes live quiet lives. They sit on the number line, do their job (being indivisible), and attract no attention. But Mersenne primes are the celebrities of the prime world. They have a formula, a fan club, and a centuries-long talent search dedicated to finding the next one.
The Formula
A Mersenne prime is a prime number of the form:
2ⁿ − 1
where n itself is prime. (If n isn’t prime, 2ⁿ − 1 is guaranteed to be composite, so we don’t bother.)
The first few:
| n | 2ⁿ − 1 | Prime? |
|---|---|---|
| 2 | 3 | Yes |
| 3 | 7 | Yes |
| 5 | 31 | Yes |
| 7 | 127 | Yes |
| 11 | 2047 = 23 × 89 | No! |
| 13 | 8191 | Yes |
Notice that n = 11 is prime, but 2¹¹ − 1 = 2047 is not. Having a prime exponent is necessary but not sufficient. Mersenne primes are picky about who gets in.
The Monk Who Started It All
Marin Mersenne (1588–1648) was a French friar, theologian, and mathematics enthusiast who served as a one-man social network for 17th-century scientists. Before email, before journals, before conferences, Mersenne personally corresponded with Descartes, Fermat, Pascal, Galileo, and dozens of others, forwarding results and posing problems.
In 1644, he published a list claiming that 2ⁿ − 1 is prime for n = 2, 3, 5, 7, 13, 17, 19, 31, 67, 127, and 257. He turned out to be wrong about some of these (he missed a few and included a few duds), but his list sparked centuries of investigation. The name stuck. Being wrong has rarely led to such lasting fame.
Why Mersenne Primes Matter
They’re connected to perfect numbers
Euclid proved that if 2ⁿ − 1 is prime, then 2ⁿ⁻¹ × (2ⁿ − 1) is a perfect number — a number equal to the sum of its proper divisors. For example:
- 2¹(2² − 1) = 2 × 3 = 6 → divisors 1 + 2 + 3 = 6 ✓
- 2²(2³ − 1) = 4 × 7 = 28 → divisors 1 + 2 + 4 + 7 + 14 = 28 ✓
Euler later proved the converse for even perfect numbers. So every Mersenne prime gives you a perfect number, and every even perfect number comes from a Mersenne prime. They’re a package deal.
They’re easy to test (relatively)
The Lucas-Lehmer test can determine whether 2ⁿ − 1 is prime using only about n squarings and reductions. This makes Mersenne candidates much faster to check than random numbers of similar size, which is why the largest known primes are almost always Mersenne primes.
They’re enormous
The largest known prime (as of late 2024) is 2¹³⁶,²⁷⁹,⁸⁴¹ − 1, a Mersenne prime with over 41 million digits. Written out in 12-point font, it would stretch for roughly 65 miles. You would get tired of reading it long before it got tired of being prime.
GIMPS: The Great Internet Mersenne Prime Search
Since 1996, the distributed computing project GIMPS has let anyone with a computer join the hunt. Volunteers donate spare CPU cycles to test enormous Mersenne candidates. GIMPS has found every new Mersenne prime since the 35th one, including the current record-holder.
As of early 2025, we know of 52 Mersenne primes. The search continues — there’s even prize money from the Electronic Frontier Foundation for milestones like the first 100-million-digit prime.
The Unsolved Questions
- Are there infinitely many Mersenne primes? Almost certainly yes. Proven? No.
- Is there a pattern to which exponents work? Not really. They’re maddeningly irregular.
- Are all even perfect numbers associated with Mersenne primes? Yes (Euler proved it). But nobody knows if odd perfect numbers exist. That’s a whole separate rabbit hole.
Star Power
If primes had a red carpet, Mersenne primes would be on it. They’re rare (52 out of infinitely many primes), they’re colossal, and they come with a built-in connection to one of the oldest questions in mathematics.
Your prime from A Prime for You is almost certainly not a Mersenne prime — there are only 52, and they’re somewhat spoken for. But your prime is in excellent company.