Do Odd Perfect Numbers Exist? What We Know in 2026
Quick answer: No odd perfect number is known, and whether one exists is still an open problem. A perfect number equals the sum of its positive divisors smaller than itself; for example, 6 = 1 + 2 + 3 and 28 = 1 + 2 + 4 + 7 + 14. All 52 known perfect numbers are even. Any odd perfect number would have to be larger than 10^1500 and have at least 10 distinct prime factors.
The ancient Greeks called a number perfect if it equals the sum of its proper divisors. Two thousand years later, we still cannot answer the most natural question about them: is there an odd one? It is one of the oldest unsolved problems in mathematics.
Perfect Numbers You Can Check
| Number | Proper divisors | Sum |
|---|---|---|
| 6 | 1, 2, 3 | 6 |
| 28 | 1, 2, 4, 7, 14 | 28 |
| 496 | 1, 2, 4, 8, 16, 31, 62, 124, 248 | 496 |
| 8128 | 1, 2, 4, …, 4064 | 8128 |
Equivalently, \(n\) is perfect when the sum of all its divisors, \(\sigma(n)\), equals \(2n\). The number 1 is not perfect: it has no proper divisors, so their sum is 0.
Every Even Perfect Number Is Known in Form
Euclid showed that if \(2^p – 1\) is prime, then \(2^{p-1}(2^p – 1)\) is perfect. Euler proved the converse: every even perfect number has this form. So even perfect numbers correspond exactly to Mersenne primes:
| \(p\) | \(2^p – 1\) | Perfect number |
|---|---|---|
| 2 | 3 | 6 |
| 3 | 7 | 28 |
| 5 | 31 | 496 |
| 7 | 127 | 8128 |
With 52 known Mersenne primes, there are 52 known perfect numbers, all even. Note that the Euclid–Euler theorem only describes even perfect numbers; it says nothing about odd ones, which is why the question stays open.
What an Odd Perfect Number Would Need
| Condition | Meaning | Source |
|---|---|---|
| \(N > 10^{1500}\) | At least 1,501 digits | Ochem and Rao (2012, published) |
| \(N > 10^{2200}\) | A stronger size bound | Reported by Ochem from later computations |
| At least 10 distinct prime factors | 10 different primes divide it | Pace Nielsen (2015) |
| At least 101 prime factors counted with repetition | Repeated primes counted each time | Ochem and Rao (2012); later reported as 121 |
| Largest prime factor \(> 10^8\) | Some prime factor is huge | Goto and Ohno (2008) |
| Euler’s form \(N = q^{k} m^2\) | Exactly one prime has an odd exponent | Euler |
“Distinct” versus “with repetition” matters: \(12 = 2^2 \cdot 3\) has 2 distinct prime factors but 3 counted with repetition. In Euler’s form, \(q\) is prime, \(q \equiv k \equiv 1 \pmod 4\), and \(q\) does not divide \(m\). These bounds come from arguments that eliminate whole families of factorizations, not from testing every odd number one by one.
Each condition narrows the search, but none rules odd perfect numbers out. Mathematicians even study “spoofs.” Descartes’s 1638 number \(198{,}585{,}576{,}189 = 3^2 \cdot 7^2 \cdot 11^2 \cdot 13^2 \cdot 22021\) passes the perfect-number calculation if you pretend 22021 is prime. But \(22021 = 19^2 \cdot 61\), and with the true factorization the number is abundant, not perfect.
Why Is It So Hard?
To rule out odd perfect numbers you must control the divisor sum of every possible odd number, and the constraints so far only push the possible size higher. Many experts suspect none exist, but no proof is in sight.
Common Misconceptions
“Computers have checked them all.” Computers rule out ranges, but there are infinitely many odd numbers.
“Perfect numbers are rare, so odd ones are impossible.” Rarity is not a proof.
Watch: Odd Perfect Numbers in Video
If you learn better by watching, these videos are worth your time.
Check Your Understanding
Five quick questions to see how much of this has stuck. Pick an answer and press Submit; you will see a short explanation either way.
Answer each question and press Submit to see your result right away.
Frequently Asked Questions
What is a perfect number?
A positive integer equal to the sum of its proper divisors, such as 6 = 1 + 2 + 3 or 28 = 1 + 2 + 4 + 7 + 14.
Do odd perfect numbers exist?
Nobody knows. No odd perfect number has been found, and none has been ruled out. If one exists, it exceeds 10^1500 (published 2012; later computations report 10^2200) and has at least 10 distinct prime factors.
How are perfect numbers related to Mersenne primes?
Every even perfect number has the form 2^(p−1)(2^p − 1) where 2^p − 1 is a Mersenne prime, and every such number is perfect (Euclid and Euler).
What is a spoof odd perfect number?
A near-miss, like Descartes’s number 198,585,576,189, that would be odd perfect if one of its factors were treated as prime when it is not.
Keep Exploring
- Mersenne Primes: List of All 52 Known (2026)
- Largest Known Prime Number (2026): 41,024,320 Digits
- Goldbach Conjecture Explained: Is It Proved?
Sources and Further Reading
Related to This Article
More math articles
- Rounding to the Nearest 10, 100, and 1,000 for 4th Grade
- Play Sudoku Online
- Top 10 ISEE Middle Level Prep Books (Our 2027 Favorite Picks)
- Indiana ILEARN Grade 7 Math Worksheets: 95 Free Printable PDFs with Answer Keys
- Decimals in Action: How to Master Multiplication and Division
- GCF Calculator: Greatest Common Factor of Two or More Numbers (with Steps)
- Percent of Change Practice — Increase & Decrease (Free)
- Public financing
- Theme and How It Is Supported
- The Best Grade 5 ELA Practice Tests for Maine Students


What people say about "Do Odd Perfect Numbers Exist? What We Know in 2026 - Effortless Math"?
No one replied yet.