The number 60132
60132 is a composite number with 12 divisors. Its prime factorisation is × 3 × 5011. Divisors (12): 1, 2, 3, 4, 6, 12, 5011, 10022, 15033, 20044, 30066, 60132.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60132: a Harshad number: divisible by its digit sum 12.
- 2
60132 is composite. Its prime factorisation is
- 3
The divisors add up to 140336; without 60132 itself that is 80204, so 60132 is abundant (80204 is more than 60132). Euler's totient φ(60132) = 20040 numbers up to 60132 share no factor with it.
- 4
The digits of 60132 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60132 = 2^{2} \times 3 \times 5011 \]60132 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 140336 |
| Euler totient φ(n) | 20040 |
| Square | 3615857424 |
| Cube | 217428738619968 |
| Square root | 245.218270 (= 2√15033) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.0132 × |
60132 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and thirty-two |
| Binary (base 2) | 1110101011100100 |
| Octal (base 8) | 165344 |
| Hexadecimal (base 16) | EAE4 |
| Base 3 | 10001111010 |
| As time | 60132 seconds = 16 h 42 min 12 s |
Is 60132 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60132 ÷ 2 = 30066) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (60132 ÷ 3 = 20044) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (60132 ÷ 4 = 15033) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (60132 ÷ 6 = 10022) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7. |
| 8 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (60132 ÷ 12 = 5011) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60132 a prime number?
No. 60132 = × 3 × 5011, so it is divisible by 2.
What are the factors of 60132?
1, 2, 3, 4, 6, 12, 5011, 10022, 15033, 20044, 30066, 60132.
What is 60132 in binary?
1110101011100100 (hexadecimal EAE4, octal 165344).
What is the square root of 60132?
About 245.2183, exactly 2√15033.
Is 60132 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 60132?
60132 is a Harshad number: divisible by its digit sum 12.