Perfect Number Checker

Perfect Number Checker — Classify Perfect, Abundant & Deficient Numbers

Check if a number is perfect, abundant, or deficient with step-by-step explanation. Learn about proper divisors, Mersenne primes, and the Euclid-Euler theorem. For related number theory tools, see our factors of a number calculator.

Table of Contents

1. 1What Is a Perfect Number?
2. 2Abundant and Deficient Numbers
3. 3How to Check for Perfect Numbers
4. 4Step-by-Step Examples
5. 5More Classification Examples
6. 6The Euclid-Euler Theorem
7. 7Mersenne Primes Connection
8. 8Known Perfect Numbers
9. 9Common Mistakes to Avoid
10. 10Historical Significance
11. 11Practice Problems with Solutions
12. 12Tips for Mastering Number Classification
13. 13Final Thoughts
14. 14FAQ: Common Questions

Check Perfect, Abundant, or Deficient

Enter a positive integer to check if it's perfect, abundant, or deficient. Click Check for step-by-step working.

Enter a Number

Result will appear here.

Note: A perfect number is a positive integer that equals the sum of its proper divisors. The first perfect number is 6 (1 + 2 + 3 = 6), followed by 28, 496, and 8128.

---

Perfect Numbers – Complete Explanation

A perfect number is a positive integer that equals the sum of its proper divisors — all positive divisors except the number itself. These rare and beautiful numbers have fascinated mathematicians since ancient Greece. Only 51 perfect numbers are known today, and it's still unknown whether any odd perfect numbers exist.

Perfect Number Definition

A number n is perfect if: sum of all proper divisors of n = n

Equivalently: σ(n) = 2n, where σ(n) is the sum of all divisors.

The first perfect number is 6: proper divisors 1, 2, 3 → 1 + 2 + 3 = 6.

1. What Is a Perfect Number?

A perfect number answers the question: "Can this number be perfectly decomposed into the sum of its proper parts?"

Key facts:

• Known perfect numbers: Only 51 have been discovered (all even).
• Odd perfect numbers: None found — it's an open problem in mathematics.
• Even perfect numbers: All follow the Euclid-Euler formula: 2ᵖ⁻¹(2ᵖ - 1) where 2ᵖ - 1 is a Mersenne prime.
• Growth: 6, 28, 496, 8128, 33,550,336, ...

2. Abundant and Deficient Numbers

Numbers are classified into three categories:

Perfect: Sum of proper divisors = the number.

Example: 6 → 1 + 2 + 3 = 6 ✓

Abundant: Sum > the number.

Example: 12 → 1 + 2 + 3 + 4 + 6 = 16 > 12

Deficient: Sum < the number.

Example: 10 → 1 + 2 + 5 = 8 < 10

All primes are deficient.

3. How to Check for Perfect Numbers

1. Find all proper divisors (divisors less than the number).
2. Sum the proper divisors.
3. Compare: = → Perfect, > → Abundant, < → Deficient.

4. Step-by-Step Examples

Example 1: Checking 28 (Perfect)

Check if 28 is a perfect number.

Step 1: Proper divisors of 28: 1, 2, 4, 7, 14
Step 2: Sum: 1 + 2 + 4 + 7 + 14 = 28
Step 3: Sum (28) = Number (28)

Result: 28 is a PERFECT NUMBER! ✨

Example 2: Checking 12 (Abundant)

Check if 12 is perfect, abundant, or deficient.

Step 1: Proper divisors: 1, 2, 3, 4, 6
Step 2: Sum = 16
Step 3: 16 > 12

Result: 12 is ABUNDANT.

5. More Classification Examples

6: 1 + 2 + 3 = 6 → PERFECT

18: 1+2+3+6+9 = 21 > 18 → ABUNDANT

14: 1+2+7 = 10 < 14 → DEFICIENT

496: Sum = 496 → PERFECT

6. The Euclid-Euler Theorem

Euclid-Euler Theorem

An even number is perfect if and only if it has the form:
  2p-1(2p - 1)
where 2p - 1 is a Mersenne prime.

p = 2: 2¹ × 3 = 6 ✓

p = 3: 2² × 7 = 28 ✓

p = 5: 2⁴ × 31 = 496 ✓

p = 7: 2⁶ × 127 = 8128 ✓

7. Mersenne Primes Connection

Mersenne primes are primes of the form 2ᵖ - 1. Every Mersenne prime generates one perfect number, and vice versa.

Open Problem: Whether infinitely many perfect numbers exist and whether any odd perfect numbers exist remain unsolved.

8. Known Perfect Numbers

1. 6
2. 28
3. 496
4. 8,128
5. 33,550,336
6. 8,589,869,056
7. 137,438,691,328
8. 2,305,843,008,139,952,128

9. Common Mistakes to Avoid

• Including the number itself: Proper divisors are strictly less than n.
• Missing divisors: Use the square root method.
• Confusing with perfect squares: Different concepts entirely.
• Assuming abundant means "many divisors": It's about the sum, not the count.

10. Historical Significance

• Ancient Greece: Pythagoreans studied perfect numbers around 500 BCE.
• Euclid: Proved 2ᵖ⁻¹(2ᵖ - 1) is perfect when 2ᵖ - 1 is prime.
• Euler: Proved all even perfect numbers are of this form.
• Modern: GIMPS distributed computing searches for Mersenne primes.

11. Practice Problems with Solutions

Problem 1: Is 20 perfect, abundant, or deficient?

Solution: Sum = 22 > 20 → ABUNDANT

Problem 2: Verify 496 is perfect.

Solution: Sum = 496 ✓ → PERFECT

Problem 3: Classify 17.

Solution: Prime → sum = 1 < 17 → DEFICIENT

Problem 4: p = 13, 2¹³ - 1 = 8191 is prime. Find the perfect number.

Solution: 2¹² × 8191 = 33,550,336

12. Tips for Mastering Number Classification

• Use the square root method for efficient divisor finding.
• All primes are deficient.
• Multiples of perfect numbers are often abundant.
• Abundancy index > 2 means abundant.
• Perfect numbers are rare.

13. Final Thoughts

Perfect numbers represent one of the most elegant intersections of number theory — connecting prime numbers, powers of two, and the sum of divisors. From Euclid's ancient proof to modern distributed computing, perfect numbers continue to captivate mathematicians.

Use this calculator to explore number classification, but practice finding divisors and their sums manually to build number sense and fluency.

14. Frequently Asked Questions

A perfect number is a positive integer that equals the sum of its proper divisors (all divisors except the number itself). The first perfect number is 6 (1 + 2 + 3 = 6), followed by 28 (1 + 2 + 4 + 7 + 14 = 28), 496, and 8128.

For an abundant number, the sum of proper divisors exceeds the number (e.g., 12: 1+2+3+4+6 = 16 > 12). For a deficient number, the sum is less than the number (e.g., 10: 1+2+5 = 8 < 10). Perfect numbers are the rare case where sum = number.

The theorem states: an even number is perfect if and only if it has the form 2ᵖ⁻¹(2ᵖ - 1), where 2ᵖ - 1 is a Mersenne prime. Euclid proved the "if" direction; Euler proved the "only if" direction, completely characterizing all even perfect numbers.

No odd perfect numbers have been found. Whether any exist is one of the oldest unsolved problems in mathematics. If they exist, they must be greater than 10¹⁵⁰⁰, have at least 101 prime factors, and satisfy many other restrictive conditions. Most mathematicians believe they don't exist, but no proof has been found.

A Mersenne prime is a prime number of the form 2ᵖ - 1 (where p is also prime). The first few are 3, 7, 31, 127, 8191. Each Mersenne prime generates exactly one even perfect number through the formula 2ᵖ⁻¹(2ᵖ - 1). The largest known primes are Mersenne primes.

As of 2024, 51 perfect numbers have been discovered — all even, corresponding to the 51 known Mersenne primes. The largest known perfect number has over 49 million digits. It's unknown whether infinitely many perfect numbers exist.

Yes. Every prime number p has only one proper divisor: 1. Therefore, the sum of proper divisors of any prime is 1, which is less than p (for p > 1). This makes all primes deficient numbers.

Explore Math Topics

Continue your learning journey with our other math guides

🔢 Basic Arithmetic 📐 Pre-Algebra 📊 Algebra 📏 Geometry 📈 Statistics

Related Calculators

Explore these other math tools that complement number classification:

• 🔹 Factors of a Number Calculator — Find all factors and factor pairs.
• 🔹 Prime Factorization Calculator — Break down numbers into prime factors.
• 🔹 Prime Number Checker — Check if a number is prime or composite.
• 🔹 Perfect Square Checker — Check if a number is a perfect square.
• 🔹 Divisor Count Calculator — Count all divisors of a number.
• 🔹 Sum of Divisors Calculator — Calculate the sum of all divisors.

Conclusion

Perfect numbers represent one of the most elegant intersections of number theory. Use this calculator to explore number classification, but practice finding divisors and their sums manually to build number sense and fluency.

Readers who wish to continue practicing and reinforce what they've learned can explore the companion learning resource for guided exercises.