Deficient Number Checker
Our free calculus calculator solves deficient number problems. Get worked examples, visual aids, and downloadable results.
Calculator
Adjust values & calculateProper Divisors of 15
Neighborhood Classification
Range [1, 100] Summary
Deficient Numbers in Range
Formula
A number n is deficient when the sum of its proper divisors s(n) is less than n. The deficiency is defined as n - s(n). All prime numbers and all prime powers are deficient. Approximately 75% of positive integers are deficient.
Last reviewed: December 2025
Worked Examples
Example 1: Checking if 15 is Deficient
Example 2: Checking a Power of 2
Background & Theory
The Deficient 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 Deficient 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
Deficient if s(n) < n, where s(n) = sum of proper divisors
A number n is deficient when the sum of its proper divisors s(n) is less than n. The deficiency is defined as n - s(n). All prime numbers and all prime powers are deficient. Approximately 75% of positive integers are deficient.
Worked Examples
Example 1: Checking if 15 is Deficient
Problem: Determine whether 15 is a deficient number by finding all proper divisors and computing their sum.
Solution: Proper divisors of 15: 1, 3, 5\nSum of proper divisors: 1 + 3 + 5 = 9\nCompare: 9 < 15\nDeficiency: 15 - 9 = 6\nDeficiency ratio: 9/15 = 0.6000
Result: 15 is DEFICIENT with deficiency 6 (divisor sum 9 < 15)
Example 2: Checking a Power of 2
Problem: Verify that 32 (which is 2^5) is deficient and find its deficiency.
Solution: Proper divisors of 32: 1, 2, 4, 8, 16\nSum of proper divisors: 1 + 2 + 4 + 8 + 16 = 31\nCompare: 31 < 32\nDeficiency: 32 - 31 = 1\nAs expected for powers of 2, the deficiency is exactly 1.
Result: 32 is DEFICIENT with deficiency 1 (almost perfect number)
Frequently Asked Questions
What is a deficient number?
A deficient number is a positive integer where the sum of its proper divisors is less than the number itself. Proper divisors include all positive divisors of a number except the number itself. For example, the number 8 has proper divisors 1, 2, and 4, which sum to 7. Since 7 is less than 8, the number 8 is deficient with a deficiency of 1. The deficiency of a number is calculated as the number minus its proper divisor sum. Most positive integers are deficient, making them the most common of the three classifications (deficient, perfect, and abundant). All prime numbers and all powers of primes are deficient, which contributes to deficient numbers being the majority.
Why are all prime numbers deficient?
Every prime number is deficient because a prime number p has exactly two divisors: 1 and p itself. Since proper divisors exclude the number itself, the only proper divisor of any prime is 1. The sum of proper divisors is therefore always 1, which is always less than p for any prime greater than 1. This makes the deficiency of a prime p equal to p minus 1, which is the maximum possible deficiency for any number of that magnitude. For instance, the prime number 13 has only the proper divisor 1, so its deficiency is 13 minus 1 equals 12. This property means primes are the most extremely deficient numbers, having the smallest possible ratio of divisor sum to number value.
What proportion of positive integers are deficient?
Approximately 75.24% of all positive integers are deficient, making them by far the most common classification. The remaining numbers are either abundant (approximately 24.76%) or perfect (effectively 0%, as perfect numbers are extremely rare). Among odd numbers, the percentage of deficient numbers is even higher, around 87%, because odd abundant numbers are quite rare (the smallest being 945). Among even numbers, roughly 64% are deficient. As you look at larger ranges of integers, these proportions stabilize around these values. The dominance of deficient numbers makes intuitive sense because having many divisors (which leads to a large divisor sum) requires having many small prime factors, which is a special structural property that most numbers lack.
Are powers of 2 always deficient?
Yes, every power of 2 is deficient, and they form an interesting pattern. For 2 raised to the power k, the proper divisors are 1, 2, 4, 8, up to 2 raised to (k minus 1). The sum of these divisors is 2 raised to k minus 1, using the geometric series formula. Since 2 raised to k minus 1 is always one less than the number itself (2 raised to k), every power of 2 has a deficiency of exactly 1. For example, 16 equals 2 to the fourth has divisors summing to 1 plus 2 plus 4 plus 8 equals 15, giving a deficiency of 1. This makes powers of 2 the least deficient of all deficient numbers relative to their size. They are sometimes called almost perfect numbers because their divisor sum is just one short of the number.
What is the relationship between deficient numbers and number theory?
Deficient numbers play a central role in several areas of number theory. The sigma function, which computes the sum of all divisors of a number, classifies numbers as deficient, perfect, or abundant based on whether sigma(n) is less than, equal to, or greater than 2n. Deficient numbers connect to the study of aliquot sequences, where you repeatedly take the proper divisor sum; deficient numbers tend to lead to sequences that decrease to 1. They also relate to the Riemann hypothesis through the behavior of the sigma function and its growth rate. In algebraic number theory, deficient numbers appear in the study of ideal class groups and the distribution of primes. The Erdos-Nicolas conjecture and various open problems in multiplicative number theory involve the distribution of deficient numbers.
Can even numbers be deficient?
Yes, many even numbers are deficient. While even numbers tend to have more divisors than odd numbers (since 2 is always a factor), many even numbers still have a divisor sum smaller than themselves. Examples include 2, 4, 8, 10, 14, 16, 22, 26, 32, and 34. Powers of 2 (2, 4, 8, 16, 32, 64, and so on) are always deficient, as discussed above. Even numbers that are the product of exactly two primes (semiprimes) like 10 equals 2 times 5 are usually deficient because they have relatively few divisors. However, even numbers with many small prime factors tend to be abundant because they accumulate many divisors. Roughly 64% of even numbers are deficient, compared to about 87% of odd numbers.
References
Reviewed by Manoj Kumar, Mathematics Educator · Editorial policy