# deficient number

A deficient number is an integer $n$ such that its proper divisors add up to less than itself, or all its divisors^{} add up to less than twice itself. For example, 26. Its proper divisors are 1, 2 and 13, which add up to 16, which is 10 short of 26. Or if we also add 26, the divisors add up to 42, which is 10 short of 52.

All prime numbers^{} are deficient, since 1 is their only proper divisor. With $\sigma (n)$ being the sum of divisors function, we can write that for a prime number $p$ it is always the case that $\sigma (p)=p+1$. Thanks to Euclid’s proof of the infinitude of primes, it is also proven that there are infinitely many deficient numbers.

An integer power of two (${2}^{x}$ for $x>0$) is always deficient, since its proper divisors add up to ${2}^{x}-1$.

Given a pair of amicable numbers, the greater of the two is deficient and its proper divisors add up to the smaller of the two, while the lesser of the two is an abundant number with its proper divisors adding up to the larger of the two.

Title | deficient number |
---|---|

Canonical name | DeficientNumber |

Date of creation | 2013-03-22 15:52:18 |

Last modified on | 2013-03-22 15:52:18 |

Owner | PrimeFan (13766) |

Last modified by | PrimeFan (13766) |

Numerical id | 5 |

Author | PrimeFan (13766) |

Entry type | Definition |

Classification | msc 11A05 |

Synonym | defective number |

Related topic | AmicableNumbers |