What Are Mersenne Prime Numbers?

Mersenne primes have the form 2^p − 1, where p is prime and the resulting number is also prime. The expression is easy to write, but successful exponents are rare. This family includes many of the largest primes ever verified and has an exact mathematical link to every known even perfect number.

What Makes a Prime Mersenne

A Mersenne number is any positive integer of the form 2ⁿ − 1. A Mersenne prime is a Mersenne number that is prime. The name comes from Marin Mersenne, the seventeenth-century scholar who studied numbers of this form.

The distinction between the two terms prevents a common error. Every Mersenne prime is a Mersenne number, but most Mersenne numbers are composite.

• 2² − 1 = 3 — prime
• 2³ − 1 = 7 — prime
• 2⁵ − 1 = 31 — prime
• 2¹¹ − 1 = 2047 — composite

The final example shows that a prime exponent does not guarantee a Mersenne prime.

Why the Exponent Must Be Prime

If n is composite, write it as n = ab, where both factors exceed 1. Then:

2^ab − 1 = (2^a − 1)(2^a(b−1) + 2^a(b−2) + … + 2^a + 1)

The expression factors, so it cannot be prime. A Mersenne prime therefore needs a prime exponent.

The reverse does not hold. For p = 11, the exponent is prime, yet:

2¹¹ − 1 = 2047 = 23 × 89

Prime exponents identify the candidates worth testing. They do not settle the primality question.

Properties of Mersenne Primes

GIMPS Search Status in 2026

The Great Internet Mersenne Prime Search reached a first-pass milestone on July 24, 2026, when every exponent below 141 million had received at least one primality test. Earlier that month, GIMPS completed verification of every test below 81 million.

A first test and a verified test are separate stages. A first test checks a candidate for primality. Verification repeats or validates the result through an independent proof path. On August 17, 2026, GIMPS listed 272,882 tests remaining before every result below M136279841 was verified.

Why the Last Two Rankings Are Provisional

The GIMPS list labels M82589933 as 51* and M136279841 as 52*. The asterisk means provisional ranking. Not every candidate between M77232917 and M136279841 has completed the full elimination and verification process.

The known count of 52 is not in doubt. The uncertainty concerns ordered position. A smaller Mersenne prime could, in principle, be found among an unverified candidate range. Such a discovery would change the ordinal numbers assigned to the last two entries without changing their primality.

GIMPS completed all verification below M77232917 on September 8, 2025, which fixed that number’s place as the 50th Mersenne prime. The same type of full coverage has not yet reached M82589933 or M136279841.

Why the Binary Form Is Useful

In base 2, 2^p − 1 is written as a row of p ones. For example:

• 2³ − 1 = 7, written as 111 in binary
• 2⁵ − 1 = 31, written as 11111 in binary
• 2⁷ − 1 = 127, written as 1111111 in binary

Mersenne numbers are therefore binary repunits. Their form also supports efficient modular reduction on binary hardware. Computations that would be costly for an arbitrary number of similar size can use the identity 2^p ≡ 1 mod (2^p − 1).

Why Record Primes Often Belong to This Family

Large-prime searches do not test every odd integer in order. They focus on families with useful structure. Mersenne numbers provide a narrow candidate set, fast modular arithmetic, mature testing software, and a definitive specialized test.

This does not make Mersenne primes common. Most prime exponents still produce composite numbers. The form makes the search manageable, not predictable.

The Name and Its Mathematical History

Marin Mersenne published a list of exponents that he believed produced primes of the form 2^p − 1 for values of p up to 257. Later calculations found both omissions and incorrect entries.

Leonhard Euler proved that 2³¹ − 1 is prime. Work by Édouard Lucas and Derrick Henry Lehmer later produced the sequence test now used to prove primality for very large Mersenne candidates.

2026 Marks 150 Years Since Lucas Proved M127 Prime

In 1876, Édouard Lucas proved that 2¹²⁷ − 1 is prime. The number has 39 decimal digits, and 2026 marks the 150th anniversary of that proof.

Lucas’s work on sequences for Mersenne numbers later developed into the test refined by Derrick Henry Lehmer and now known as the Lucas–Lehmer test.

From Hand Calculation to Distributed Search

Early work depended on hand calculation, algebraic factorization, and limited mechanical assistance. Modern searches distribute candidates across many CPUs and GPUs. GIMPS, founded in 1996, coordinates this work and has found the most recent Mersenne primes.

M136279841 was first reported as a probable prime by GPU software. Several independent Lucas–Lehmer runs on different programs and hardware then confirmed the result.

The Euclid–Euler Link to Even Perfect Numbers

A perfect number equals the sum of its positive divisors smaller than itself. The first examples are:

• 6 = 1 + 2 + 3
• 28 = 1 + 2 + 4 + 7 + 14
• 496
• 8128

The Euclid–Euler theorem gives an exact classification of every even perfect number:

If 2^p − 1 is prime, then 2^p−1(2^p − 1) is an even perfect number.

Euclid proved this forward direction. Euler later proved the converse: every even perfect number has this form. Mersenne primes and even perfect numbers therefore correspond one to one.

Why the Formula Produces a Perfect Number

Let M_p = 2^p − 1 be prime and define:

N = 2^p−1M_p

Because M_p is prime, the proper divisors of N fall into two groups: powers of two from 1 through 2^p−1, and those powers multiplied by M_p up to 2^p−2M_p. Their sum is:

(1 + 2 + … + 2^p−1) + M_p(1 + 2 + … + 2^p−2)

Using the geometric-series formula, this becomes:

(2^p − 1) + M_p(2^p−1 − 1) = 2^p−1M_p = N

The proper divisors add back to the original number, so N is perfect.

The 52 known Mersenne primes therefore produce 52 known even perfect numbers. The existence of an odd perfect number remains unresolved. None has been found, and no proof rules all of them out.

How Mersenne Candidates Are Tested

Modern searches usually eliminate easy composites before running a full primality test. GIMPS uses trial factoring and P−1 factoring to look for factors. Candidates that survive move to a probable-prime test.

A PRP result can show that a candidate is composite or that it is probably prime. A rare probable-prime result is then checked with the Lucas–Lehmer test, which gives a definitive result for a Mersenne number with prime exponent.

The Lucas–Lehmer Sequence

For an odd prime exponent p, begin with:

s₀ = 4

Then repeat:

s_n+1 = s_n² − 2 mod (2^p − 1)

The number 2^p − 1 is prime exactly when s_p−2 = 0. The test avoids trying to factor the entire candidate, which is one reason it works well at record sizes.

For ordinary integers, the prime number checker can identify whether a manageable input is prime or composite. Research-scale Mersenne candidates need specialized software, proof files, and independent verification.

Known Examples and the Current Record

The first Mersenne prime exponents are:

2, 3, 5, 7, 13, 17, 19, 31, 61, 89, 107, 127

They produce:

3, 7, 31, 127, 8191, 131071, 524287, 2147483647, …

Last verified August 17, 2026: 52 Mersenne primes are known. The largest is 2^136,279,841 − 1, discovered in October 2024 by Luke Durant through GIMPS. It has 41,024,320 decimal digits.

Why the Count Is Small

Prime exponents become less dense as their size grows. Mersenne prime exponents are rarer still because most prime exponents fail the second condition: the resulting Mersenne number is composite.

No formula predicts exactly which prime exponents will work. Statistical models estimate how often new examples may appear, but they do not identify the next successful exponent.

Mersenne Numbers and Related Ideas

Mersenne Numbers

These are all numbers of the form 2ⁿ − 1, whether prime or composite. Examples include 3, 7, 15, 31, 63, and 127.

Mersenne Primes

These are Mersenne numbers that are prime. The number 31 qualifies. The numbers 15 and 63 do not.

Even Perfect Numbers

Every even perfect number is generated by one Mersenne prime through 2^p−1(2^p − 1). This is a full classification, not merely a recurring pattern.

Fermat Numbers

Fermat numbers have the form 2²ⁿ + 1. Like Mersenne numbers, they are built from powers of two, but their primality behavior and testing methods differ.

Composite Mersenne Numbers

Composite cases also reveal useful factor patterns. The example 2047 = 23 × 89 shows why checking only the exponent is insufficient.

Open Questions

The main unresolved question is direct: Are there infinitely many Mersenne primes? No proof is known.

The distribution of successful exponents is also unresolved. Known examples occur irregularly, and the gaps between them vary widely. Computation can extend the list, but it does not yet provide a theorem that predicts the list.

Perfect numbers add another open problem. Every even perfect number has been classified through the Euclid–Euler theorem, yet mathematicians still do not know whether any odd perfect number exists.

FAQ About Mersenne Prime Numbers