The number 53157
53157 is a composite number with 16 divisors. Its prime factorisation is 3 × 13 × 29 × 47. Divisors (16): 1, 3, 13, 29, 39, 47, 87, 141, 377, 611, 1131, 1363, 1833, 4089, 17719, 53157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 53157: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
53157 is composite. Its prime factorisation is
- 3
The divisors add up to 80640; without 53157 itself that is 27483, so 53157 is deficient (27483 is less than 53157). Euler's totient φ(53157) = 30912 numbers up to 53157 share no factor with it.
- 4
The digits of 53157 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 53157 = 3 \times 13 \times 29 \times 47 \]
53157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 80640 |
| Euler totient φ(n) | 30912 |
| Square | 2825666649 |
| Cube | 150203962060893 |
| Square root | 230.558019 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.3157 × |
53157 in other forms
| Form | Value |
|---|---|
| In words | fifty-three thousand one hundred and fifty-seven |
| Binary (base 2) | 1100111110100101 |
| Octal (base 8) | 147645 |
| Hexadecimal (base 16) | CFA5 |
| Base 3 | 2200220210 |
| As time | 53157 seconds = 14 h 45 min 57 s |
Is 53157 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 (53157 ÷ 3 = 17719) | 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 2) | 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 6) | 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 5) | 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 7) | 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 53157 a prime number?
No. 53157 = 3 × 13 × 29 × 47, so it is divisible by 3.
What are the factors of 53157?
1, 3, 13, 29, 39, 47, 87, 141, 377, 611, 1131, 1363, 1833, 4089, 17719, 53157.
What is 53157 in binary?
1100111110100101 (hexadecimal CFA5, octal 147645).
What is the square root of 53157?
About 230.5580.
Is 53157 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 53157?
53157 is a happy number: repeatedly adding the squares of its digits reaches 1.