Deficient Number Checker
Our free calculus calculator solves deficient number problems. Get worked examples, visual aids, and downloadable results.
Reviewed for accuracy by Manoj Kumar, Mathematics Educator
Deficient Number Checker
Calculator
Adjust values & calculateEnter your values below. Every result is computed in your browser — no data is sent to any server.
Formula: Deficient if s(n) < n, where s(n) = sum of proper divisors
Worked example — 15 is DEFICIENT with deficiency 6 (divisor sum 9 < 15)
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 Sum of proper divisors: 1 + 3 + 5 = 9 Compare: 9 < 15 Deficiency: 15 - 9 = 6 Deficiency 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 Sum of proper divisors: 1 + 2 + 4 + 8 + 16 = 31 Compare: 31 < 32 Deficiency: 32 - 31 = 1 As 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.
How is deficiency different from abundance?
Deficiency and abundance are opposite concepts measuring how a number relates to its proper divisor sum. A deficient number has a proper divisor sum less than itself (deficiency equals n minus the sum, a positive value), while an abundant number has a proper divisor sum greater than itself (abundance equals the sum minus n, a positive value). A perfect number sits exactly at the boundary where the sum equals the number (both deficiency and abundance are zero). For example, 8 is deficient with deficiency 1 (divisor sum 7 is less than 8), 12 is abundant with abundance 4 (divisor sum 16 exceeds 12), and 6 is perfect (divisor sum 6 equals 6). The deficiency ratio s(n)/n is less than 1 for deficient numbers, equal to 1 for perfect, and greater than 1 for abundant.
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.
What are almost perfect numbers and how do they relate to deficient numbers?
Almost perfect numbers are a special subset of deficient numbers where the proper divisor sum equals n minus 1, meaning the deficiency is exactly 1. The known almost perfect numbers are all powers of 2: the numbers 1, 2, 4, 8, 16, 32, 64, 128, and so on. It is an open conjecture whether any non-power-of-2 almost perfect numbers exist. No odd almost perfect number has been found, and it has been proven that if one exists, it must be a perfect square and must be greater than 10 to the 30th power. The concept of almost perfect numbers extends to k-almost perfect numbers where the divisor sum equals n minus k. These classifications help mathematicians understand the fine structure of how divisor sums distribute across the integers.
How do I quickly determine if a large number is deficient?
Several shortcuts can help determine deficiency without computing all divisors. First, all prime numbers are immediately deficient. Second, if a number has a small number of prime factors with small exponents, it is likely deficient. Third, you can use the multiplicative property of the sigma function: for n equal to the product of prime powers p1 to a1 times p2 to a2, the divisor sum sigma(n) equals the product of (p_i to the (a_i plus 1) minus 1) divided by (p_i minus 1). Compare 2n to this product. Fourth, if n has no small prime factors (all prime factors exceed the square root of n), then n has at most 2 divisors and is deficient. Fifth, any number of the form p raised to k (a prime power) is deficient because its divisor sum is (p to the (k plus 1) minus 1) divided by (p minus 1), which is always less than 2 times p to the k.
What is the significance of the deficiency ratio?
The deficiency ratio, defined as the proper divisor sum divided by n (or equivalently sigma(n) divided by 2n), provides a normalized measure of how deficient or abundant a number is. For deficient numbers, this ratio is less than 1, with values closer to 0 indicating more extreme deficiency. Prime numbers have the smallest possible ratio of 1/p, approaching 0 for large primes. For perfect numbers, the ratio is exactly 1. For abundant numbers, it exceeds 1. Highly composite numbers and superabundant numbers tend to have the largest ratios. The average value of sigma(n) divided by n over all integers from 1 to N approaches pi squared over 6 (approximately 1.6449) as N grows, a result connected to the Riemann zeta function evaluated at 2. This connection between divisor sums and deep analytic number theory makes the deficiency ratio a fundamental quantity in mathematics.
References
Reviewed for accuracy by Manoj Kumar, Mathematics Educator · Editorial policy
Related Calculators
🧮Abundant Number Checker
Calculate abundant 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.
🧮Mixed Number Calculator
Calculate mixed number with inputs, formulas, and instant results.
🧮Mixed Number to Improper Fraction Calculator
Calculate mixed number to improper fraction with inputs, formulas, and instant results.