Perfect Number Calculator: Finally Understand Perfect, Abundant, and Deficient Numbers
Let me tell you about the first time I learned about perfect numbers. I was reading a math history book, and I discovered that ancient Greeks were fascinated by numbers that equal the sum of their proper divisors. The smallest perfect number, 6, has proper divisors 1, 2, and 3—and 1 + 2 + 3 = 6.
I thought, "That's beautiful. Are there more?" Then I learned about 28, 496, and 8128. And then I learned that no one knows if there are infinitely many perfect numbers, or if any odd perfect numbers exist.
In this guide, I'll walk you through everything you need to know about perfect numbers—from proper divisors to classification, and the mysterious connection to Mersenne primes.
Ready to explore perfect numbers? Try our Perfect Number Calculator and discover the magic of numbers that equal their own divisor sums.
What Is a Perfect Number?
A perfect number is a positive integer that equals the sum of its proper divisors (all positive divisors except the number itself).
The First Four Perfect Numbers
| # | Number | Proper Divisors | Sum |
|---|---|---|---|
| 1 | 6 | 1, 2, 3 | 1 + 2 + 3 = 6 |
| 2 | 28 | 1, 2, 4, 7, 14 | 1 + 2 + 4 + 7 + 14 = 28 |
| 3 | 496 | 1, 2, 4, 8, 16, 31, 62, 124, 248 | 1+2+4+8+16+31+62+124+248 = 496 |
| 4 | 8,128 | 1, 2, 4, 8, 16, 32, 64, 127, 254, 508, 1016, 2032, 4064 | Sum = 8,128 |
Visual Check: 6
Divisors of 6: 1, 2, 3, 6
Proper divisors: 1, 2, 3 (exclude 6)
Sum: 1 + 2 + 3 = 6 ✓ PERFECT!
Three Classifications of Numbers
Based on the sum of proper divisors s(n) compared to n:
| Type | Condition | Example |
|---|---|---|
| Perfect | s(n) = n | 6, 28, 496, 8128 |
| Abundant | s(n) > n | 12, 18, 20, 24, 30, 36 |
| Deficient | s(n) < n | 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13 |
Examples of Each Type
Perfect: 28
- Proper divisors: 1, 2, 4, 7, 14
- Sum: 1 + 2 + 4 + 7 + 14 = 28
Abundant: 12
- Proper divisors: 1, 2, 3, 4, 6
- Sum: 1 + 2 + 3 + 4 + 6 = 16
- 16 > 12 → abundant (abundance = 4)
Deficient: 8
- Proper divisors: 1, 2, 4
- Sum: 1 + 2 + 4 = 7
- 7 < 8 → deficient (deficiency = 1)
The Euclid-Euler Theorem
This is the fundamental theorem connecting perfect numbers to Mersenne primes:
An even number is perfect if and only if it has the form 2^(p-1) × (2^p - 1), where 2^p - 1 is a Mersenne prime.
How It Works
| p | Mersenne Prime (2^p - 1) | Perfect Number Formula | Perfect Number |
|---|---|---|---|
| 2 | 3 | 2^(1) × 3 | 2 × 3 = 6 |
| 3 | 7 | 2^(2) × 7 | 4 × 7 = 28 |
| 5 | 31 | 2^(4) × 31 | 16 × 31 = 496 |
| 7 | 127 | 2^(6) × 127 | 64 × 127 = 8,128 |
| 13 | 8,191 | 2^(12) × 8,191 | 4,096 × 8,191 = 33,550,336 |
Mersenne Primes
Mersenne primes are primes of the form 2^p - 1, where p is prime.
| p | 2^p - 1 | Mersenne Prime? |
|---|---|---|
| 2 | 3 | ✓ |
| 3 | 7 | ✓ |
| 5 | 31 | ✓ |
| 7 | 127 | ✓ |
| 11 | 2,047 | ✗ (23 × 89) |
| 13 | 8,191 | ✓ |
| 17 | 131,071 | ✓ |
| 19 | 524,287 | ✓ |
List of Known Perfect Numbers
Only 51 perfect numbers are known as of 2024. All are even.
| # | Perfect Number | Digits | Mersenne Prime Exponent p |
|---|---|---|---|
| 1 | 6 | 1 | 2 |
| 2 | 28 | 2 | 3 |
| 3 | 496 | 3 | 5 |
| 4 | 8,128 | 4 | 7 |
| 5 | 33,550,336 | 8 | 13 |
| 6 | 8,589,869,056 | 10 | 17 |
| 7 | 137,438,691,328 | 12 | 19 |
| 8 | 2,305,843,008,139,952,128 | 19 | 31 |
| 9 | 2,658,455,991,569,831,744,654,692,615,953,842,176 | 37 | 61 |
| 10 | 191,561,942,608,236,107,294,793,378,084,303,638,130,997,321,548,169,216 | 54 | 89 |
The largest known perfect number (51st) has over 49 million digits!
Properties of Perfect Numbers
Property 1: All Known Perfect Numbers Are Even
No odd perfect number has ever been found. It's unknown if any exist.
Property 2: Perfect Numbers End in 6 or 8
Pattern alternates: 6, 28 (ends 8), 496 (ends 6), 8128 (ends 8), 33550336 (ends 6)...
Property 3: Perfect Numbers Are Triangular Numbers
Every perfect number is a triangular number (can be arranged as an equilateral triangle).
- 6 = 1 + 2 + 3
- 28 = 1 + 2 + 3 + 4 + 5 + 6 + 7
- 496 = 1 + 2 + ... + 31
- 8128 = 1 + 2 + ... + 127
Property 4: Sum of Reciprocals of Divisors
For a perfect number n, the sum of reciprocals of all divisors equals 2.
Example: 6
- Divisors: 1, 2, 3, 6
- 1/1 + 1/2 + 1/3 + 1/6 = 1 + 0.5 + 0.333... + 0.166... = 2
Property 5: Binary Representation
Perfect numbers in binary have a beautiful pattern:
- 6 = 110₂
- 28 = 11100₂
- 496 = 111110000₂
- 8128 = 1111111000000₂
Step-by-Step Examples
Example 1: Check if 28 is Perfect
Step 1: Find all proper divisors of 28
- 28 ÷ 1 = 28 → divisor: 1
- 28 ÷ 2 = 14 → divisors: 2, 14
- 28 ÷ 4 = 7 → divisors: 4, 7
- 28 ÷ 7 = 4 (already have)
- 28 ÷ 14 = 2 (already have)
- 28 ÷ 28 = 1 (exclude, it's the number itself)
Proper divisors: 1, 2, 4, 7, 14
Step 2: Sum the proper divisors
- 1 + 2 + 4 + 7 + 14 = 28
Step 3: Compare sum to original number
- 28 = 28
Result: 28 is PERFECT! ✨
Example 2: Check if 12 is Perfect
Step 1: Find proper divisors of 12
- 1, 2, 3, 4, 6 (exclude 12)
Step 2: Sum = 1 + 2 + 3 + 4 + 6 = 16
Step 3: Compare
- 16 > 12
Result: 12 is ABUNDANT (abundance = 4)
Example 3: Check if 8 is Perfect
Step 1: Proper divisors of 8
- 1, 2, 4
Step 2: Sum = 1 + 2 + 4 = 7
Step 3: Compare
- 7 < 8
Result: 8 is DEFICIENT (deficiency = 1)
Example 4: Check if 1 is Perfect
Step 1: Proper divisors of 1
- None (1 has no proper divisors)
Step 2: Sum = 0
Step 3: Compare
- 0 < 1
Result: 1 is DEFICIENT (by convention)
Abundant Numbers
Numbers where sum of proper divisors > the number.
First Few Abundant Numbers
| Number | Proper Divisors | Sum | Abundance |
|---|---|---|---|
| 12 | 1,2,3,4,6 | 16 | 4 |
| 18 | 1,2,3,6,9 | 21 | 3 |
| 20 | 1,2,4,5,10 | 22 | 2 |
| 24 | 1,2,3,4,6,8,12 | 36 | 12 |
| 30 | 1,2,3,5,6,10,15 | 42 | 12 |
| 36 | 1,2,3,4,6,9,12,18 | 55 | 19 |
| 40 | 1,2,4,5,8,10,20 | 50 | 10 |
Smallest Abundant Number
12 is the smallest abundant number.
Odd Abundant Numbers
The smallest odd abundant number is 945:
- Proper divisors sum to 975
- 975 > 945 (abundance = 30)
Deficient Numbers
Numbers where sum of proper divisors < the number.
Most Numbers Are Deficient
| Number | Proper Divisors | Sum | Deficiency |
|---|---|---|---|
| 1 | none | 0 | 1 |
| 2 | 1 | 1 | 1 |
| 3 | 1 | 1 | 2 |
| 4 | 1,2 | 3 | 1 |
| 5 | 1 | 1 | 4 |
| 7 | 1 | 1 | 6 |
| 8 | 1,2,4 | 7 | 1 |
| 9 | 1,3 | 4 | 5 |
| 10 | 1,2,5 | 8 | 2 |
| 11 | 1 | 1 | 10 |
Prime Numbers Are Always Deficient
For any prime p, proper divisors = {1}, sum = 1, deficiency = p - 1.
How to Use Our Perfect Number Calculator
Step 1: Enter a Number
Type any positive integer. Example: 28
Step 2: Click Verify Perfection
The calculator finds all proper divisors and sums them.
Step 3: Read Your Results
You'll see:
- Classification: Perfect, Abundant, or Deficient
- Proper divisors: Complete list
- Divisor sum: Total of proper divisors
- Difference: Abundance or deficiency amount
- Visual proof: Equation showing divisors sum = original
Preset Buttons
Quick test the first four perfect numbers:
- 6
- 28
- 496
- 8,128
What It Handles
| Input | Example | Classification |
|---|---|---|
| 6 | 6 | Perfect |
| 28 | 28 | Perfect |
| 12 | 12 | Abundant |
| 8 | 8 | Deficient |
| 1 | 1 | Deficient |
| Prime numbers | 17 | Deficient |
| Powers of 2 | 16 | Deficient |
| Large numbers | 33,550,336 | Perfect (5th perfect) |
The Mystery of Odd Perfect Numbers
The Open Problem
No one knows if any odd perfect numbers exist. This is one of the oldest unsolved problems in mathematics.
What We Know
If an odd perfect number exists, it must:
- Be greater than 10^1500
- Have at least 10 distinct prime factors
- Have a prime factor greater than 10^8
- Be of the form 12k + 1 or 36k + 9
- Have at least 101 prime factors (counting multiplicity)
Why It Matters
The search for odd perfect numbers has led to important developments in number theory. Many mathematicians believe none exist, but no one has proved it.
Fun Facts About Perfect Numbers
Ancient Discovery
Perfect numbers were studied by the Pythagoreans (6th century BCE) and Euclid (300 BCE).
Only 51 Known
Despite thousands of years of study, only 51 perfect numbers are known. The 51st was discovered in 2018.
Biblical Reference
Some scholars note that 28 (the second perfect number) is the number of days in the lunar month, and 496 (the third) is the numerical value of the Greek word for "creation."
Connection to Mersenne Primes
Every even perfect number corresponds to a Mersenne prime. Finding new perfect numbers means finding new Mersenne primes—which are extremely rare.
The Great Internet Mersenne Prime Search (GIMPS)
Volunteers around the world use their computers to search for new Mersenne primes (and thus new perfect numbers). The last several perfect numbers were discovered by GIMPS.
Common Mistakes
Mistake 1: Including the Number Itself
Wrong: Divisors of 6 are 1, 2, 3, 6 → sum = 12 Right: Proper divisors exclude the number itself → 1 + 2 + 3 = 6
Mistake 2: Thinking All Perfect Numbers End in 6
Wrong: "All perfect numbers end in 6" Right: They alternate: 6, 28 (ends 8), 496 (ends 6), 8128 (ends 8)...
Mistake 3: Confusing Perfect with Prime
Wrong: "Perfect numbers are prime" Right: All perfect numbers > 6 are composite (they have many divisors)
Mistake 4: Forgetting 1 Has No Proper Divisors
Wrong: Proper divisors of 1 are {1} Right: 1 has no proper divisors (sum = 0)
Mistake 5: Thinking All Abundant Numbers Are Even
Wrong: "Only even numbers can be abundant" Right: 945 is the smallest odd abundant number
Quick Reference
First 10 Perfect Numbers
| # | Perfect Number | Digits |
|---|---|---|
| 1 | 6 | 1 |
| 2 | 28 | 2 |
| 3 | 496 | 3 |
| 4 | 8,128 | 4 |
| 5 | 33,550,336 | 8 |
| 6 | 8,589,869,056 | 10 |
| 7 | 137,438,691,328 | 12 |
| 8 | 2,305,843,008,139,952,128 | 19 |
| 9 | 2,658,455,991,569,831,744,654,692,615,953,842,176 | 37 |
| 10 | 191,561,942,608,236,107,294,793,378,084,303,638,130,997,321,548,169,216 | 54 |
Classification Summary
| Condition | Type | Example |
|---|---|---|
| s(n) = n | Perfect | 6, 28, 496 |
| s(n) > n | Abundant | 12, 18, 20, 24, 30 |
| s(n) < n | Deficient | 1, 2, 3, 4, 5, 7, 8, 9, 10 |
Formulas
| Formula | Purpose |
|---|---|
| s(n) = σ(n) - n | Sum of proper divisors |
| σ(n) = ∏(p^(e+1) - 1)/(p - 1) | Sum of all divisors |
| n = 2^(p-1) × (2^p - 1) | Even perfect number (where 2^p - 1 is prime) |
Frequently Asked Questions
What's a perfect number?
A positive integer that equals the sum of its proper divisors (all divisors except itself).
How many perfect numbers are known?
Only 51 perfect numbers are known as of 2024.
Are there odd perfect numbers?
No one knows. This is a famous unsolved problem in mathematics.
What's the smallest perfect number?
6 (1 + 2 + 3 = 6).
What's the largest known perfect number?
The 51st perfect number has over 49 million digits.
Are all perfect numbers even?
All known perfect numbers are even. No odd perfect numbers have been found.
What's an abundant number?
A number where the sum of proper divisors is greater than the number itself.
What's a deficient number?
A number where the sum of proper divisors is less than the number itself.
What's the smallest abundant number?
12 (1 + 2 + 3 + 4 + 6 = 16 > 12).
How does your calculator find proper divisors?
It checks all numbers from 1 to √n, adding both i and n/i when i divides n.
Your Turn: Start Exploring
Perfect numbers are one of the most beautiful topics in number theory—simple to understand but connected to deep unsolved problems.
Here's your practice plan:
- Start with the classics: 6, 28, 496, 8128
- Test abundant numbers: 12, 18, 20, 24, 30, 36
- Test deficient numbers: 8, 9, 10, 11, 13, 14, 15
- Try prime numbers: 2, 3, 5, 7, 11, 13, 17 (all deficient)
- Test powers of 2: 2, 4, 8, 16, 32, 64 (all deficient)
- Find odd abundant: Try 945 (the smallest!)
- Use the presets: One-click test of known perfect numbers
Ready to start? Open up our Perfect Number Calculator and try it yourself. Start with 6, then 28, then 12, then 8.
You'll discover the beauty of perfect numbers faster than you think.
Have questions? Stuck on a particular number? Drop a comment below or reach out. I've been where you are, and I'm happy to help.
— The Solvezi Team
Disclaimer: This calculator is for educational purposes. For very large numbers (>10^12), calculations may take a few seconds.
