The number 60152
60152 is a composite number with 16 divisors. Its prime factorisation is × 73 × 103. Divisors (16): 1, 2, 4, 8, 73, 103, 146, 206, 292, 412, 584, 824, 7519, 15038, 30076, 60152.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
60152 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
60152 is composite. Its prime factorisation is
- 3
The divisors add up to 115440; without 60152 itself that is 55288, so 60152 is deficient (55288 is less than 60152). Euler's totient φ(60152) = 29376 numbers up to 60152 share no factor with it.
- 4
The digits of 60152 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60152 = 2^{3} \times 73 \times 103 \]60152 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 115440 |
| Euler totient φ(n) | 29376 |
| Square | 3618263104 |
| Cube | 217645762231808 |
| Square root | 245.259047 (= 2√15038) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 91 |
| Scientific notation | 6.0152 × |
60152 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and fifty-two |
| Binary (base 2) | 1110101011111000 |
| Octal (base 8) | 165370 |
| Hexadecimal (base 16) | EAF8 |
| Base 3 | 10001111212 |
| As time | 60152 seconds = 16 h 42 min 32 s |
Is 60152 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (60152 ÷ 2 = 30076) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (60152 ÷ 4 = 15038) | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 | Yes (60152 ÷ 8 = 7519) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60152 a prime number?
No. 60152 = × 73 × 103, so it is divisible by 2.
What are the factors of 60152?
1, 2, 4, 8, 73, 103, 146, 206, 292, 412, 584, 824, 7519, 15038, 30076, 60152.
What is 60152 in binary?
1110101011111000 (hexadecimal EAF8, octal 165370).
What is the square root of 60152?
About 245.2590, exactly 2√15038.
Is 60152 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 60152?
It is a composite number with 16 divisors.