The number 60153
60153 is a composite number with 4 divisors. Its prime factorisation is 3 × 20051. Divisors (4): 1, 3, 20051, 60153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 60153: a semiprime: 3 × 20051, the product of two primes.
- 2
60153 is composite. Its prime factorisation is
- 3
The divisors add up to 80208; without 60153 itself that is 20055, so 60153 is deficient (20055 is less than 60153). Euler's totient φ(60153) = 40100 numbers up to 60153 share no factor with it.
- 4
The digits of 60153 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 60153 = 3 \times 20051 \]
60153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 80208 |
| Euler totient φ(n) | 40100 |
| Square | 3618383409 |
| Cube | 217656617201577 |
| Square root | 245.261085 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 65 |
| Scientific notation | 6.0153 × |
60153 in other forms
| Form | Value |
|---|---|
| In words | sixty thousand one hundred and fifty-three |
| Binary (base 2) | 1110101011111001 |
| Octal (base 8) | 165371 |
| Hexadecimal (base 16) | EAF9 |
| Base 3 | 10001111220 |
| As time | 60153 seconds = 16 h 42 min 33 s |
Is 60153 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (60153 ÷ 3 = 20051) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 60153 a prime number?
No. 60153 = 3 × 20051, so it is divisible by 3.
What are the factors of 60153?
1, 3, 20051, 60153.
What is 60153 in binary?
1110101011111001 (hexadecimal EAF9, octal 165371).
What is the square root of 60153?
About 245.2611.
Is 60153 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 60153?
60153 is a semiprime: 3 × 20051, the product of two primes.