Count of the dividers

The tables below list all the Diviseur S of the numbers from 1 to 1000.

A dividing of a Integer N is an entirety m , expressed N / m which is again an entirety (which is also necessarily a divider of N ). For example, 3 is a divider of 21, because 21/3  =  7 (and 7 is also a divider of 21).

If m is a divider of N then it is − m . The tables below list only the positive dividers.

Caption tables

  • D ( N ) is the number of positive dividers of N , including 1 and N itself

  • σ ( N ) is the sum of all the positive dividers of N , including 1 and N itself
  • S ( N ) is the sum of the clean Diviseurs of N , which does not include N itself
  • a perfect number equalizes the sum of the clean dividers; like this:
s (N) =n \, \! ; the only perfect numbers ranging between 1 and 1000 are 6, 28 and 496
  • a defective Nombre is lower than the sum of its own dividers; like this:
s (N) < N \, \!
  • a abundant Nombre is higher than the sum of its own dividers; like this:
s (N) >n \, \!
  • a Prime number does not admit only 1 and itself like divider S; like this:
d (N) =2 \, \!

Dividers of the numbers from 1 to 100

Dividers of the numbers from 101 to 200

Dividers of the numbers from 201 to 300

Dividers of the numbers from 301 to 400

Dividers of the numbers from 401 to 500

Dividers of the numbers from 501 to 600

Dividers of the numbers from 601 to 700

Dividers of the numbers from 701 to 800

Dividers of the numbers from 801 to 900

Dividers of the numbers from 901 to 1000

See too

  • Table of the factors first of the numbers from 1 to 1000

Random links:LVe front century J. - C. | Turner Field | Roza Anagnosti | Federation of Amapá of football | Primula allionii | Oakdale,_la_Californie