The current largest known prime number is not written out as a wall of digits. Mathematicians write it in a cleaner form: 2136,279,841 − 1. This number has 41,024,320 decimal digits, so its compact exponent form says far more than the full decimal expansion could show on a normal page.
The number is also known as M136279841. It belongs to the family of Mersenne primes, prime numbers that have the form 2p − 1. The exponent here, 136,279,841, is itself prime.
As of 2026, no larger prime number has been publicly verified and accepted in the main prime-record databases.
The Largest Known Prime Number Right Now
The largest known prime number is:
2136,279,841 − 1
Decimal length: 41,024,320 digits
It was found through the Great Internet Mersenne Prime Search, usually shortened to GIMPS. The discovery is credited to Luke Durant and the wider GIMPS effort. The number was proven prime in October 2024, then independently confirmed through additional checks.
Small primes fit neatly in the mind: 2, 3, 5, 7, 11, 13. This record prime does not. Its size belongs to computational number theory, where special forms, proof methods, hardware, and verification all matter.
| Topic | Record Detail |
|---|---|
| Prime Number | 2136,279,841 − 1 |
| Short Name | M136279841 |
| Decimal Digits | 41,024,320 |
| Prime Type | Mersenne prime |
| General Form | 2p − 1, where p is prime |
| Discovery Date | October 12, 2024 |
| Known Mersenne Prime Count | 52nd known Mersenne prime |
| Previous Record | 282,589,933 − 1, with 24,862,048 digits |
| Open Question | Whether infinitely many Mersenne primes exist remains unknown |
Why the Word “Known” Matters
There is no largest prime number. That is a theorem, not a guess.
Euclid showed that prime numbers never end. Given any finite list of primes, one can reason that another prime must exist outside that list. The modern record therefore means largest prime currently discovered and verified, not largest prime possible.
This distinction matters because prime records change. A larger verified prime may appear later, but it would not change the older theorem: prime numbers are infinite.
Why the Record Is a Mersenne Prime
A Mersenne number has the form 2p − 1. When that number is prime, it becomes a Mersenne prime. The current record has exactly that shape.
Many of the largest known primes are Mersenne primes because this form allows special tests that work better than general-purpose primality tests at extreme sizes. Not easier in a casual sense. Just more mathematically workable.
Mersenne Numbers Are Not Always Prime
The exponent must be prime for 2p − 1 to have any chance of being prime. If the exponent is composite, the number factors in a predictable way.
Yet a prime exponent does not guarantee a Mersenne prime. For example, 11 is prime, but:
211 − 1 = 2047 = 23 × 89
So the search does not end when the exponent is prime. That is only the starting gate.
The Binary Shape Is Simple
In base 2, a Mersenne number looks clean: 2p − 1 is written as p ones in a row. For the current record, the binary form contains 136,279,841 ones.
The decimal form looks far less tidy, even though it represents the same number.
How a 41-Million-Digit Number Can Be Proven Prime
Primality is not accepted by size, pattern, or probability alone. A claimed record prime needs a proof path that other mathematicians and computer systems can verify.
For Mersenne primes, the classic tool is the Lucas-Lehmer test. It applies only to Mersenne numbers with prime exponents, and it gives a definite answer: prime or composite. This is why Mersenne numbers dominate the top of prime-record lists.
The current record was first reported through a probable-prime route and then confirmed with more exact testing. Several programs and hardware setups were involved. That matters. A record of this size needs more than one clean pass.
Proof Is Different From Finding
Finding a candidate is one part of the process. Proving it is prime is another.
Large prime searches often use distributed computing. Many machines test different candidates, and most candidates fail. A rare one survives. Then verification begins: independent runs, different software, separate hardware, repeated checks.
How Large Is 2136,279,841 − 1?
The decimal expansion has 41,024,320 digits. If printed in a plain line with no spaces, it would be unreadable for ordinary use. The exponent form is not a shortcut that hides uncertainty; it is the proper mathematical name for the number.
The digit count comes from logarithms. For a number near 2p, the number of decimal digits is found from p × log10(2), then rounded down and increased by one. For this exponent, that gives the known total: 41,024,320 digits.
It Is Huge, but Not Random
The number has a tight structure. It is one less than a power of two. That structure makes it searchable, testable, and nameable. A random 41-million-digit number would be harder to discuss and harder to verify with the same tools.
For ordinary integers, primality lives on a much smaller scale. A site tool such as the Prime Number Checker is suited to everyday numbers, examples, and learning-level checks rather than a research record with tens of millions of digits.
Why Mathematicians Search for Larger Primes
Record primes do not settle the question of infinity. Euclid already handled that. Their value lies elsewhere: algorithms, verification methods, distributed computing, hardware testing, and the study of special prime families.
Large prime searches connect several areas of mathematics:
- Number theory, where primes form the basis of divisibility and factorization.
- Computational mathematics, where algorithms turn theory into verifiable results.
- Primality testing, which separates prime numbers from composites without factoring every case.
- Distributed computing, where many machines work on pieces of the same search.
The record is not just a trophy number. It is a stress test for mathematical software, hardware reliability, and proof methods.
Prime Records and the Distribution of Primes
Primes become thinner as numbers grow larger. The prime number theorem describes this pattern using the prime-counting function π(x), which counts how many primes are less than or equal to x.
A simplified form says:
π(x) ~ x / log(x)
This does not predict the exact next prime. It describes density. Near very large numbers, primes are sparse, yet they keep appearing without end.
Large Gaps Do Not Mean the Search Stops
Prime gaps grow on average, but no final wall appears. Even when prime numbers are rare, rarity is not absence.
That is part of the appeal. The record prime sits inside a pattern that is partly understood and partly unresolved.
Where M136279841 Fits Among Other Prime Families
Prime numbers come in many named types. The current record belongs to one special family, but nearby concepts help make the record easier to understand.
Mersenne Primes
A Mersenne prime has the form 2p − 1. The current record is the largest known example. Mersenne primes also connect to even perfect numbers: when 2p − 1 is prime, the number 2p−1(2p − 1) is perfect.
Fermat Primes
Fermat primes have the form 22n + 1. Only a few are known. They appear in classical geometry because they connect with constructible regular polygons.
Twin Primes
Twin primes are pairs such as 11 and 13 or 17 and 19. They differ by 2. Mathematicians still do not know whether infinitely many twin prime pairs exist.
Co-Prime Numbers
Two numbers are co-prime when they share no prime factor. For example, 8 and 15 are co-prime, even though neither number is prime. This idea belongs to the same divisibility language that makes prime numbers so useful.
Prime Factorization
Every integer greater than 1 can be written as a product of primes in one way, apart from the order of the factors. This is the fundamental theorem of arithmetic. Quiet, but heavy with meaning.
What This Record Does Not Mean
The largest known prime is often misunderstood because its size sounds close to science fiction. The math is cleaner than the headlines.
- It is not the largest prime possible. Infinitely many primes exist.
- It is not useful just because it is huge. Size alone does not make a prime practical.
- It is not printed out in normal use. The exponent form is the meaningful form.
- It is not proof that all large primes are Mersenne primes. Mersenne primes are easier to test at record scale, so they dominate records.
Does the Largest Known Prime Help Cryptography?
Modern cryptography uses prime numbers, but not primes with tens of millions of decimal digits. Systems such as RSA use large primes chosen for a practical security setting, usually far smaller than record primes.
A 41-million-digit Mersenne prime is mainly a research and verification achievement. It shows what current methods and machines can prove. It does not directly make ordinary encryption stronger.
Why the Next Record May Also Be a Mersenne Prime
The next record does not have to be Mersenne. Still, history gives Mersenne primes an advantage because the Lucas-Lehmer test and related software make them unusually suitable for record searches.
Other prime forms can reach great sizes too. Generalized Fermat primes and other structured primes appear in large-prime databases. Yet at the very top, Mersenne primes have held the record many times because their form is so testable.
Open Questions Around the Record
Even after a 41-million-digit prime, several simple-sounding questions remain open:
- Are there infinitely many Mersenne primes? No proof is known.
- Are there infinitely many twin primes? This remains unresolved.
- How are prime gaps shaped at extreme sizes? Many patterns are known, but exact behavior still invites study.
- How far can verified prime records grow? Better algorithms and hardware keep moving the boundary.
In a topic filled with exact proofs, some of the most natural questions are still open. That tension is part of number theory.
FAQ About the Largest Known Prime Number
What is the largest known prime number?
The largest known prime number is 2136,279,841 − 1. It has 41,024,320 decimal digits and is known as M136279841.
Is there a largest prime number?
No. There is no largest prime number. Euclid proved that prime numbers continue without end, so any record is only the largest prime currently known.
Why are the largest known primes usually Mersenne primes?
Mersenne primes have the form 2p − 1. Their special structure allows efficient primality tests, especially the Lucas-Lehmer test, so they are easier to verify at record sizes than most random-looking numbers.
How many digits does the largest known prime have?
It has 41,024,320 digits in base 10. In binary, it is written as 136,279,841 ones.
Who discovered the current largest known prime?
It was discovered through GIMPS, the Great Internet Mersenne Prime Search. The discovery is credited to Luke Durant and the wider GIMPS team effort.
Are record primes used directly in encryption?
No. Cryptographic systems use large primes, but not primes with tens of millions of digits. Record primes mainly support mathematical research, testing methods, and computational verification.