Factor a number
View
Result
Factorization of 60
Prime factorization
Exponent form
2^2 * 3 * 5
Divisor count τ(n)
12
Sum of divisors σ(n)
168
Type
Abundant (σ-n > n)
Neighbors (click to set)
57
4 div
58
4 div
59
prime
60
12 div
61
prime
62
4 div
63
6 div
Recent
Apply a factoring pattern
Step-by-step
1
2
3
GCD & LCM
Number A
&
Number B
GCD
LCM
a \u00B7 b = gcd \u00B7 lcm
How this works
What just happened
Every integer greater than 1 has a unique prime factorization (Fundamental Theorem of Arithmetic). For 60:
Divisor count
If , the number of divisors is the product . Each exponent contributes one more choice.
Worth knowing
Abundant
Proper divisors sum to more than 60 (108). The smallest abundant number is 12.
Nearby numbers
| n | Prime factorization | div # |
|---|---|---|
| 55 | 4 | |
| 56 | 8 | |
| 57 | 4 | |
| 58 | 4 | |
| 59 | prime | 2 |
| 60 | 12 | |
| 61 | prime | 2 |
| 62 | 4 | |
| 63 | 6 | |
| 64 | 7 | |
| 65 | 4 | |
| 66 | 8 |