Perfect Number Checker
Check if a number is perfect, abundant, or deficient by comparing it to the sum of its proper divisors. View divisor pairs, sigma function values, and an interactive visual breakdown with animated charts.
Your ad blocker is preventing us from showing ads
MiniWebtool is free because of ads. If this tool helped you, please support us by going Premium (ad‑free + faster tools), or allowlist MiniWebtool.com and reload.
- Allow ads for MiniWebtool.com, then reload
- Or upgrade to Premium (ad‑free)
About Perfect Number Checker
Welcome to the Perfect Number Checker, an interactive tool for exploring one of the oldest and most beautiful concepts in number theory. Enter any positive integer to instantly discover whether it is perfect, abundant, or deficient. The tool calculates all proper divisors, displays animated visualizations, and provides a step-by-step mathematical breakdown of the classification.
What is a Perfect Number?
A perfect number is a positive integer that is equal to the sum of its proper divisors (all positive divisors excluding the number itself). Perfect numbers are exceptionally rare and have fascinated mathematicians for over 2,000 years, since the time of the ancient Greeks.
where \(\sigma(n)\) is the sum of all divisors of \(n\)
The first few perfect numbers are:
- 6 = 1 + 2 + 3
- 28 = 1 + 2 + 4 + 7 + 14
- 496 = 1 + 2 + 4 + 8 + 16 + 31 + 62 + 124 + 248
- 8,128 = 1 + 2 + 4 + 8 + 16 + 32 + 64 + 127 + 254 + 508 + 1016 + 2032 + 4064
Abundant and Deficient Numbers
Every positive integer falls into exactly one of three categories based on how the sum of its proper divisors compares to the number itself:
- Perfect: Sum of proper divisors = the number (e.g., 6, 28, 496)
- Abundant: Sum of proper divisors > the number (e.g., 12, 18, 20, 24)
- Deficient: Sum of proper divisors < the number (e.g., 1, 2, 3, 4, 5, 7, 8)
Most numbers are deficient. All prime numbers are deficient (their only proper divisor is 1). The smallest abundant number is 12, whose divisors 1 + 2 + 3 + 4 + 6 = 16 > 12.
The Connection to Mersenne Primes
One of the most remarkable results in number theory, proven by Euler, establishes that every even perfect number has the form:
where \(2^p - 1\) is a Mersenne prime
This means finding new perfect numbers is equivalent to finding new Mersenne primes (primes of the form \(2^p - 1\)). As of 2024, only 51 Mersenne primes are known, corresponding to 51 known even perfect numbers.
Do Odd Perfect Numbers Exist?
Whether any odd perfect number exists is one of the oldest unsolved problems in mathematics. No odd perfect number has ever been found, and it has been proven that if one exists, it must be greater than \(10^{1500}\) and have at least 75 prime factors. Most mathematicians believe none exist, but a proof remains elusive.
The Abundancy Index
The abundancy index of a number \(n\) is defined as \(\sigma(n)/n\), where \(\sigma(n)\) is the sum of all divisors of \(n\) (including \(n\) itself). This ratio provides a continuous measure of how "abundant" or "deficient" a number is:
- Perfect numbers always have an abundancy index of exactly 2
- Abundant numbers have an abundancy index greater than 2
- Deficient numbers have an abundancy index less than 2
How to Use This Calculator
- Enter a number: Type any positive integer into the input field, or click a quick example button to try a famous number.
- Check the number: Click "Check Number" to compute the proper divisors and their sum.
- View the classification: See whether your number is perfect, abundant, or deficient in the animated hero banner.
- Explore the visualization: Review the divisor bar chart, doughnut comparison, divisor pairs, and step-by-step calculation.
Notable Numbers
| Number | Type | Divisor Sum | Notable For |
|---|---|---|---|
| 6 | Perfect | 6 | Smallest perfect number |
| 12 | Abundant | 16 | Smallest abundant number |
| 28 | Perfect | 28 | 2nd perfect number |
| 496 | Perfect | 496 | 3rd perfect number |
| 945 | Abundant | 975 | Smallest odd abundant number |
| 8,128 | Perfect | 8,128 | 4th perfect number |
Frequently Asked Questions
What is a perfect number?
A perfect number is a positive integer that equals the sum of its proper divisors (all positive divisors excluding itself). For example, 6 is perfect because 1 + 2 + 3 = 6, and 28 is perfect because 1 + 2 + 4 + 7 + 14 = 28.
What is the difference between abundant and deficient numbers?
An abundant number has proper divisors that sum to more than the number itself (e.g., 12: 1+2+3+4+6=16 > 12). A deficient number has proper divisors that sum to less than the number (e.g., 8: 1+2+4=7 < 8). Perfect numbers are the rare cases where the sum equals the number exactly.
How many perfect numbers are known?
As of 2024, only 51 perfect numbers are known. All known perfect numbers are even. Whether any odd perfect numbers exist remains one of the oldest unsolved problems in mathematics. The largest known perfect number has over 49 million digits.
What is the connection between perfect numbers and Mersenne primes?
Euler proved that every even perfect number has the form \(2^{p-1} \times (2^p - 1)\), where \(2^p - 1\) is a Mersenne prime. Conversely, every Mersenne prime generates a perfect number via this formula. So finding new perfect numbers is equivalent to finding new Mersenne primes.
What is the abundancy index?
The abundancy index of a number \(n\) is the ratio \(\sigma(n)/n\), where \(\sigma(n)\) is the sum of all divisors of \(n\) (including \(n\) itself). Perfect numbers always have an abundancy index of exactly 2. Abundant numbers have an index greater than 2, and deficient numbers have an index less than 2.
Additional Resources
- Perfect Number - Wikipedia
- Abundant Number - Wikipedia
- Deficient Number - Wikipedia
- Mersenne Prime - Wikipedia
Reference this content, page, or tool as:
"Perfect Number Checker" at https://MiniWebtool.com// from MiniWebtool, https://MiniWebtool.com/
by miniwebtool team. Updated: Apr 16, 2026
You can also try our AI Math Solver GPT to solve your math problems through natural language question and answer.