The number 5157
5157 is a composite number with 8 divisors. Its prime factorisation is × 191. Divisors (8): 1, 3, 9, 27, 191, 573, 1719, 5157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5157: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
5157 is composite. Its prime factorisation is
- 3
The divisors add up to 7680; without 5157 itself that is 2523, so 5157 is deficient (2523 is less than 5157). Euler's totient φ(5157) = 3420 numbers up to 5157 share no factor with it.
- 4
The digits of 5157 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 147 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5157 = 3^{3} \times 191 \]5157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 7680 |
| Euler totient φ(n) | 3420 |
| Square | 26594649 |
| Cube | 137148604893 |
| Square root | 71.812255 (= 3√573) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 147 |
| Scientific notation | 5.157 × |
5157 in other forms
| Form | Value |
|---|---|
| In words | five thousand one hundred and fifty-seven |
| Binary (base 2) | 1010000100101 |
| Octal (base 8) | 12045 |
| Hexadecimal (base 16) | 1425 |
| Base 3 | 21002000 |
| As time | 5157 seconds = 1 h 25 min 57 s |
Is 5157 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 (5157 ÷ 3 = 1719) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (5157 ÷ 9 = 573) | 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 9) | 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 5157 a prime number?
No. 5157 = × 191, so it is divisible by 3.
What are the factors of 5157?
1, 3, 9, 27, 191, 573, 1719, 5157.
What is 5157 in binary?
1010000100101 (hexadecimal 1425, octal 12045).
What is the square root of 5157?
About 71.8123, exactly 3√573.
Is 5157 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 5157?
5157 is a happy number: repeatedly adding the squares of its digits reaches 1.