Supriya Ghosh (Editor)

Table of divisors

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Table of divisors

The tables below list all of the divisors of the numbers 1 to 1000.

A divisor of an integer n is an integer m, for which n/m is again an integer (which is necessarily also a divisor of n). For example, 3 is a divisor of 21, since 21/7 = 3 (and 7 is also a divisor of 21).

If m is a divisor of n then so is −m. The tables below only list positive divisors.

Key to the tables

  • d(n) is the number of positive divisors of n, including 1 and n itself
  • σ(n) is the sum of the positive divisors of n, including 1 and n itself
  • s(n) is the sum of the proper divisors of n, which does not include n itself; that is, s(n) = σ(n) − n
  • a perfect number equals the sum of its proper divisors; that is, s(n) = n
  • a deficient number is greater than the sum of its proper divisors; that is, s(n) < n
  • an abundant number is lesser than the sum of its proper divisors; that is, s(n) > n
  • a prime number has only 1 and itself as divisors; that is, d(n) = 2. Prime numbers are always deficient as s(n)=1

    • References

    Table of divisors Wikipedia
    (Text) CC BY-SA


    Similar Topics