The number 59157
59157 is a composite number with 16 divisors. Its prime factorisation is × 7 × 313. Divisors (16): 1, 3, 7, 9, 21, 27, 63, 189, 313, 939, 2191, 2817, 6573, 8451, 19719, 59157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 59157: a Harshad number: divisible by its digit sum 27.
- 2
59157 is composite. Its prime factorisation is
- 3
The divisors add up to 100480; without 59157 itself that is 41323, so 59157 is deficient (41323 is less than 59157). Euler's totient φ(59157) = 33696 numbers up to 59157 share no factor with it.
- 4
The digits of 59157 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.
LaTeX source of the formulas on this page
\[ 59157 = 3^{3} \times 7 \times 313 \]59157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 100480 |
| Euler totient φ(n) | 33696 |
| Square | 3499550649 |
| Cube | 207022917742893 |
| Square root | 243.222121 (= 3√6573) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 42 |
| Scientific notation | 5.9157 × |
59157 in other forms
| Form | Value |
|---|---|
| In words | fifty-nine thousand one hundred and fifty-seven |
| Binary (base 2) | 1110011100010101 |
| Octal (base 8) | 163425 |
| Hexadecimal (base 16) | E715 |
| Base 3 | 10000011000 |
| As time | 59157 seconds = 16 h 25 min 57 s |
Is 59157 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 (59157 ÷ 3 = 19719) | 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 | Yes (59157 ÷ 7 = 8451) | 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 (59157 ÷ 9 = 6573) | 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 10) | 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 59157 a prime number?
No. 59157 = × 7 × 313, so it is divisible by 3.
What are the factors of 59157?
1, 3, 7, 9, 21, 27, 63, 189, 313, 939, 2191, 2817, 6573, 8451, 19719, 59157.
What is 59157 in binary?
1110011100010101 (hexadecimal E715, octal 163425).
What is the square root of 59157?
About 243.2221, exactly 3√6573.
Is 59157 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 59157?
59157 is a Harshad number: divisible by its digit sum 27.