Deficient Number Checker

σ(n) < 2n?

CalculatorsFreeNo Signup
4.5(230 reviews)
All Tools

Loading tool...

About Deficient Number Checker

A deficient number checker testing if σ(n)−n < n. All primes are deficient (only divisor 1). All prime powers are deficient. Shows deficiency 2n−σ(n), divisor list, and classification. The majority (~75%) of natural numbers are deficient. Client-side.

Deficient Number Checker Features

  • Deficiency test
  • Divisor sum
  • Classification
  • Divisor list
  • Deficiency value
Deficient: σ(n)−n < n. All primes p are deficient (σ(p)=p+1, deficiency p−1). All prime powers p^k are deficient. About 75.2% of natural numbers are deficient. The deficiency of n is 2n−σ(n).

How to Use

Enter a number:

  • Classification: Deficient/Perfect/Abundant
  • σ(n): Divisor sum
  • Deficiency: 2n−σ(n)

Primes & Powers

Every prime p has σ(p)=1+p, so deficiency = p−1. Every prime power p^k has σ = (p^{k+1}−1)/(p−1) < 2p^k. So ALL prime powers are deficient. Powers of 2 have σ(2^k) = 2^{k+1}−1, deficiency just 1!

Density

~75.2% of natural numbers are deficient. Combined with ~0.0...% perfect and ~24.8% abundant, this accounts for all positive integers. Deficient numbers are the 'majority' — abundant numbers are special.

Step-by-Step Instructions

  1. 1Enter number.
  2. 2Compute σ(n).
  3. 3Check deficiency.
  4. 4See divisors.
  5. 5Classify.

Deficient Number Checker — Frequently Asked Questions

Which numbers have deficiency 1?+

Powers of 2! σ(2^k) = 2^{k+1}−1, so deficiency = 2·2^k − (2^{k+1}−1) = 1. These are 'almost perfect' numbers. It's conjectured that powers of 2 are the ONLY almost perfect numbers.

Can composite numbers be deficient?+

Yes! Many composites are deficient: 4 (σ=3+1=7<8), 8 (σ=15<16), 9 (σ=4+1=13<18), 10 (σ=8+1=18<20), 14, 15, 16... A composite is deficient when it doesn't have 'enough' divisors relative to its size.

What's the relationship to perfect numbers?+

Perfect numbers (σ(n)=2n) sit exactly on the boundary between deficient and abundant. They're extremely rare (only 51 known). Moving σ(n) below 2n gives deficient, above gives abundant.

Share this tool: