Abundant Number Checker
Our free calculus calculator solves abundant number problems. Get worked examples, visual aids, and downloadable results.
Reviewed for accuracy by Manoj Kumar, Mathematics Educator
Abundant Number Checker
Calculator
Adjust values & calculateEnter your values below. Every result is computed in your browser — no data is sent to any server.
Formula: s(n) = sum of proper divisors; Abundant if s(n) > n
Worked example — 12 is ABUNDANT with abundance 4 (divisor sum 16 > 12)
Formula
s(n) = sum of proper divisors; Abundant if s(n) > n
A number n is abundant when the sum of its proper divisors s(n) exceeds n. The abundance is s(n) - n. The abundance ratio s(n)/n indicates how abundant the number is, with values greater than 1 indicating abundance.
Worked Examples
Example 1: Checking if 12 is Abundant
Problem:Determine whether 12 is an abundant number by finding all proper divisors and their sum.
Solution:Proper divisors of 12: 1, 2, 3, 4, 6 Sum of proper divisors: 1 + 2 + 3 + 4 + 6 = 16 Compare: 16 > 12 Abundance: 16 - 12 = 4 Abundance ratio: 16/12 = 1.3333
Result:12 is ABUNDANT with abundance 4 (divisor sum 16 > 12)
Example 2: Checking if 28 is Abundant
Problem:Determine whether 28 is abundant, perfect, or deficient.
Solution:Proper divisors of 28: 1, 2, 4, 7, 14 Sum of proper divisors: 1 + 2 + 4 + 7 + 14 = 28 Compare: 28 = 28 Abundance: 28 - 28 = 0 This is a perfect number, not abundant.
Result:28 is PERFECT (divisor sum exactly equals 28)
Frequently Asked Questions
What is an abundant number?
An abundant number (also called an excessive number) is a positive integer for which the sum of its proper divisors exceeds the number itself. Proper divisors are all positive divisors of a number excluding the number itself. For example, the number 12 has proper divisors 1, 2, 3, 4, and 6, which sum to 16. Since 16 is greater than 12, the number 12 is abundant with an abundance of 4. The smallest abundant number is 12, and the first few abundant numbers are 12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 56, 60, and 66. Abundant numbers are important in number theory and have connections to perfect numbers and amicable numbers.
How are abundant numbers different from perfect and deficient numbers?
Numbers are classified into three categories based on how their proper divisor sum compares to the number itself. A perfect number has a divisor sum exactly equal to itself (like 6, where 1 plus 2 plus 3 equals 6). A deficient number has a divisor sum less than itself (like 8, where 1 plus 2 plus 4 equals 7, which is less than 8). An abundant number has a divisor sum greater than itself (like 12, where 1 plus 2 plus 3 plus 4 plus 6 equals 16, which exceeds 12). Most numbers are deficient. Approximately 24.8% of positive integers are abundant, and perfect numbers are extremely rare, with only a handful known. This three-way classification was studied by ancient Greek mathematicians including Euclid and Nicomachus.
Are all even numbers abundant?
No, not all even numbers are abundant. While many abundant numbers are even, there are plenty of even numbers that are deficient. For example, 2, 4, 8, 14, and 16 are all even but deficient. The smallest even abundant number is 12. However, it is true that every multiple of a perfect number (other than the perfect number itself) is abundant, and every multiple of an abundant number is also abundant. Additionally, every even number greater than 46 can be expressed as the sum of two abundant numbers. There are also odd abundant numbers, though they are less common. The smallest odd abundant number is 945, discovered much later in mathematical history than the concept of abundant numbers itself.
What is the smallest odd abundant number?
The smallest odd abundant number is 945, which equals 3 cubed times 5 times 7. Its proper divisors are 1, 3, 5, 7, 9, 15, 21, 27, 35, 45, 63, 105, 135, 189, and 315, which sum to 975. Since 975 is greater than 945, the number is abundant with an abundance of 30. Odd abundant numbers are significantly rarer than even abundant numbers. To find one, you typically need a number with many small prime factors that contribute multiple divisors. The next few odd abundant numbers after 945 are 1575, 2205, 2835, and 3465. All odd abundant numbers less than 10000 that are not multiples of 945 are rare, illustrating how densely the even abundant numbers populate the number line compared to their odd counterparts.
What is the density of abundant numbers among positive integers?
The natural density of abundant numbers among positive integers has been proven to be between 0.2474 and 0.2480, meaning approximately 24.76% of all positive integers are abundant. This result was established by mathematicians Marc Deleglise in 1998 and refined by subsequent researchers. The density means that roughly one in every four integers is abundant. Among even numbers, the density is higher (about 36%), while among odd numbers, it is much lower (about 13%). The density converges slowly as you look at larger ranges of numbers. Interestingly, the density of perfect numbers is zero (since there are only finitely many known and they become increasingly sparse), so the remaining roughly 75.24% of integers are deficient.
Can abundant numbers be prime?
No, a prime number can never be abundant. A prime number p has only two divisors: 1 and p itself. Its only proper divisor is 1, so the proper divisor sum is always 1, which is always less than p for any prime greater than 1. This means every prime number is deficient. In fact, prime numbers are among the most deficient numbers possible, since their proper divisor sum is as small as it can be (just 1). To be abundant, a number needs many divisors, which requires having multiple prime factors and preferably small prime factors like 2, 3, and 5. Numbers with many small prime factors tend to have many divisors and are more likely to be abundant. This is why highly composite numbers are often abundant.
What is the relationship between abundant numbers and perfect numbers?
Abundant and perfect numbers are closely connected through the sigma function, which sums all divisors of a number. A number n is perfect when sigma(n) equals 2n, abundant when sigma(n) exceeds 2n, and deficient when sigma(n) is less than 2n. Every multiple of a perfect number (other than the perfect number itself) is abundant. For example, since 6 is perfect, all multiples of 6 greater than 6 (that is, 12, 18, 24, 30, and so on) are abundant. Similarly, every multiple of an abundant number is also abundant. Perfect numbers serve as the boundary between abundant and deficient numbers. The ancient Greeks believed these classifications had mystical significance, with perfect numbers representing balance and harmony.
What are practical applications of abundant numbers?
While abundant numbers might seem purely theoretical, they have applications in several areas. In cryptography, understanding the divisor structure of numbers is essential for algorithms like RSA, where the difficulty of factoring large numbers provides security. In coding theory, abundant numbers relate to the construction of error-correcting codes that use algebraic number theory. In music theory, abundant numbers appear in the analysis of harmonic series and overtone structures. Computational number theory uses abundant numbers as test cases for divisor-sum algorithms and primality testing. In recreational mathematics, abundant numbers provide rich problems for mathematical competitions and puzzles. They also have connections to Goldbach-type conjectures about representing numbers as sums.
What is the Goldbach conjecture related to abundant numbers?
There is an interesting theorem related to abundant numbers that parallels the Goldbach conjecture: every sufficiently large even number can be expressed as the sum of two abundant numbers. More specifically, every even number greater than 46 can be written as the sum of two abundant numbers. The number 46 is the largest even number that cannot be expressed this way. For odd numbers, the situation is different; for example, every odd number greater than a certain bound can be expressed as the sum of three abundant numbers. The proof of the even case uses the fact that every multiple of 6 beyond 6 itself is abundant, combined with the observation that among any sequence of consecutive even numbers, sufficiently many can be paired with abundant complements.
How do I calculate the abundance of a number?
The abundance of a number n is defined as the proper divisor sum minus n, written as s(n) minus n, where s(n) is the sum of all proper divisors of n. To calculate it, first find all proper divisors by testing every integer from 1 up to the square root of n. For each divisor d found, both d and n divided by d are proper divisors (as long as they are not equal to n itself). Sum all the proper divisors and subtract n. If the result is positive, the number is abundant and the result is its abundance. For example, for n equals 20: divisors are 1, 2, 4, 5, 10, which sum to 22. The abundance is 22 minus 20 equals 2. A more efficient approach uses the prime factorization: if n equals the product of p_i to the a_i, then the divisor sum equals the product of (p_i to the (a_i plus 1) minus 1) divided by (p_i minus 1).
References
Reviewed for accuracy by Manoj Kumar, Mathematics Educator · Editorial policy
Related Calculators
🛡️Email Deliverability Checker
Check SPF, DKIM, and DMARC readiness for inbox placement
🍪GDPR Cookie Consent Compliance Checker
Check cookie consent compliance against GDPR, ePrivacy, and ICO requirements
🧮Deficient Number Checker
Calculate deficient number checker with inputs, formulas, and instant results.
🧮Perfect Number Checker
Calculate perfect number checker with inputs, formulas, and instant results.
🧮Sum of a Linear Number Sequence Calculator
Calculate sum of alinear number sequence with inputs, formulas, and instant results.
🧮Complex Number Calculator
Calculate complex number with inputs, formulas, and instant results.
🧮Prime Number Calculator
Calculate prime number with inputs, formulas, and instant results.
🧮Improper Fraction to Mixed Number Calculator
Calculate improper fraction to mixed number with inputs, formulas, and instant results.