Divisors of a number
Type a whole number. We list every number that divides it with no remainder, from smallest to largest.
Result
1, 2, 3, 4, 6, 9, 12, 18, 36Divisors
- Number of divisors
- 9
- Sum of divisors
- 91
- 1 × 36 = 36
- 2 × 18 = 36
- 3 × 12 = 36
- 4 × 9 = 36
- 6 × 6 = 36
Inputs
- Whole number
- 36
How it is calculated
Break the number into prime factors, for example 36 = 2² × 3².
Result
Divisors
- Number of divisors
- 9
- Sum of divisors
- 91
How it is calculated
- Break the number into prime factors, for example 36 = 2² × 3².
- Each divisor uses each prime 0, 1… up to its power times.
- Number of divisors = product of (power + 1): (2 + 1) × (2 + 1) = 9.
- Divisors come in pairs d × (n ÷ d).
Example
36 has 9 divisors: 1, 2, 3, 4, 6, 9, 12, 18, 36. Pairs: 1 × 36, 2 × 18, 3 × 12, 4 × 9, 6 × 6.
Good to know
- 0 has infinitely many divisors, so it is not accepted.
- The work is time-limited: a huge number with no small factor may be refused.
Frequently asked questions
What is this tool used for?
Type a whole number. We list every number that divides it with no remainder, from smallest to largest.
How is the result calculated?
Break the number into prime factors, for example 36 = 2² × 3².
What should I check before using the result?
0 has infinitely many divisors, so it is not accepted.