Abundant Number Checker
Our free calculus calculator solves abundant number problems. Get worked examples, visual aids, and downloadable results.
Calculator
Adjust values & calculateProper Divisors of 12
Abundant Numbers in Range [1, 100]
22 abundant numbers (22.00% density)
First 20 Abundant Numbers
Formula
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.
Last reviewed: December 2025
Worked Examples
Example 1: Checking if 12 is Abundant
Example 2: Checking if 28 is Abundant
Background & Theory
The Abundant Number Checker applies the following established principles and formulas. Mathematics rests on a hierarchy of number systems, each extending the previous. The natural numbers (1, 2, 3, ...) support counting and ordering. The integers add negative values and zero, enabling subtraction without restriction. The rational numbers, expressible as p/q where p and q are integers and q is nonzero, close the system under division. The real numbers fill the gaps left by irrationals such as the square root of 2 or pi, forming a complete ordered field. The complex numbers, written as a + bi where i is the square root of negative one, complete the algebraic closure of the reals and allow every polynomial to have a root. Prime factorization states that every integer greater than one is uniquely expressible as a product of primes, a result known as the Fundamental Theorem of Arithmetic. Computing the greatest common divisor (GCD) of two integers relies most efficiently on the Euclidean algorithm: repeatedly replace the larger number with the remainder when it is divided by the smaller, until the remainder is zero. The last nonzero remainder is the GCD. The least common multiple (LCM) follows from the identity LCM(a, b) = |a * b| / GCD(a, b). Modular arithmetic defines equivalence classes of integers that share the same remainder under division by a modulus n. Fermat's Little Theorem and Euler's Theorem arise from this structure and underpin modern cryptography. Logarithms are the inverses of exponential functions. If b raised to the power x equals y, then the logarithm base b of y equals x. The natural logarithm uses base e, approximately 2.71828. Combinatorics counts arrangements and selections. The number of ordered arrangements (permutations) of r objects from n distinct objects is nPr = n! / (n - r)!. The number of unordered selections (combinations) is nCr = n! / (r! * (n - r)!). Pascal's triangle arranges these binomial coefficients so that each entry equals the sum of the two entries directly above it. The Fibonacci sequence, defined by F(1) = 1, F(2) = 1, and F(n) = F(n-1) + F(n-2), appears throughout nature and connects deeply to the golden ratio via Binet's formula.
History
The history behind the Abundant Number Checker traces back through the following developments. Mathematics as a systematic discipline traces to ancient Mesopotamia. Babylonian clay tablets dating to around 1800 BCE demonstrate knowledge of quadratic equations, Pythagorean triples, and base-60 arithmetic, suggesting a practical mathematical tradition far preceding Greek formalism. Euclid of Alexandria compiled the Elements around 300 BCE, establishing the axiomatic method that would define rigorous mathematics for over two thousand years. His work organized plane geometry, number theory, and proportion into logically chained propositions derived from a small set of postulates. The algorithm bearing his name for computing GCDs appears in Book VII and remains in use today. In the 9th century, the Persian scholar Muhammad ibn Musa Al-Khwarizmi wrote Al-Kitab al-mukhtasar fi hisab al-jabr wal-muqabala, the treatise whose title gave algebra its name. He systematized the solution of linear and quadratic equations and described procedures that operated on unknowns as objects, a conceptual leap away from purely numerical calculation. Rene Descartes introduced coordinate geometry in 1637 by uniting algebra and Euclidean geometry, allowing curves to be studied through equations. This synthesis set the stage for calculus. Isaac Newton and Gottfried Wilhelm Leibniz independently developed calculus during the 1660s and 1670s, triggering a priority dispute that lasted decades and divided British and Continental mathematicians. Carl Friedrich Gauss proved the Fundamental Theorem of Algebra in 1799, showing that every nonconstant polynomial has at least one complex root. His Disquisitiones Arithmeticae of 1801 established modern number theory. David Hilbert's formalist program at the turn of the 20th century sought to place all of mathematics on an explicit axiomatic foundation, a project that Kurt Godel's incompleteness theorems of 1931 showed to be fundamentally limited. Alan Turing's work in the 1930s on computability introduced the theoretical model of the stored-program computer and linked mathematical logic directly to the limits of algorithmic calculation. His proof that no algorithm can decide in general whether an arbitrary program will halt or run forever placed fundamental boundaries on what mathematics can mechanically determine, and it opened the discipline now known as theoretical computer science.
Frequently Asked Questions
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\nSum of proper divisors: 1 + 2 + 3 + 4 + 6 = 16\nCompare: 16 > 12\nAbundance: 16 - 12 = 4\nAbundance 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\nSum of proper divisors: 1 + 2 + 4 + 7 + 14 = 28\nCompare: 28 = 28\nAbundance: 28 - 28 = 0\nThis 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.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy