The number 57153
57153 is a composite number with 4 divisors. Its prime factorisation is 3 × 19051. Divisors (4): 1, 3, 19051, 57153.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57153: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19051, the product of two primes.
- 2
57153 is composite. Its prime factorisation is
- 3
The divisors add up to 76208; without 57153 itself that is 19055, so 57153 is deficient (19055 is less than 57153). Euler's totient φ(57153) = 38100 numbers up to 57153 share no factor with it.
- 4
The digits of 57153 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 34 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57153 = 3 \times 19051 \]
57153 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76208 |
| Euler totient φ(n) | 38100 |
| Square | 3266465409 |
| Cube | 186688297520577 |
| Square root | 239.066936 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 34 |
| Scientific notation | 5.7153 × |
57153 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand one hundred and fifty-three |
| Binary (base 2) | 1101111101000001 |
| Octal (base 8) | 157501 |
| Hexadecimal (base 16) | DF41 |
| Base 3 | 2220101210 |
| As time | 57153 seconds = 15 h 52 min 33 s |
Is 57153 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 (57153 ÷ 3 = 19051) | 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 5) | 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 3) | 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 8) | 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 57153 a prime number?
No. 57153 = 3 × 19051, so it is divisible by 3.
What are the factors of 57153?
1, 3, 19051, 57153.
What is 57153 in binary?
1101111101000001 (hexadecimal DF41, octal 157501).
What is the square root of 57153?
About 239.0669.
Is 57153 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 57153?
57153 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 19051, the product of two primes.