The number 57150
57150 is a composite number with 36 divisors. Its prime factorisation is 2 × × × 127. Divisors (36): 1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 127 … 57150.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57150: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.
- 2
57150 is composite. Its prime factorisation is
- 3
The divisors add up to 154752; without 57150 itself that is 97602, so 57150 is abundant (97602 is more than 57150). Euler's totient φ(57150) = 15120 numbers up to 57150 share no factor with it.
- 4
The digits of 57150 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 197 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57150 = 2 \times 3^{2} \times 5^{2} \times 127 \]57150 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 154752 |
| Euler totient φ(n) | 15120 |
| Square | 3266122500 |
| Cube | 186658900875000 |
| Square root | 239.060662 (= 15√254) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 197 |
| Scientific notation | 5.715 × |
57150 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand one hundred and fifty |
| Binary (base 2) | 1101111100111110 |
| Octal (base 8) | 157476 |
| Hexadecimal (base 16) | DF3E |
| Base 3 | 2220101200 |
| As time | 57150 seconds = 15 h 52 min 30 s |
Is 57150 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57150 ÷ 2 = 28575) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (57150 ÷ 3 = 19050) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (57150 ÷ 5 = 11430) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (57150 ÷ 6 = 9525) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (57150 ÷ 9 = 6350) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (57150 ÷ 10 = 5715) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57150 a prime number?
No. 57150 = 2 × × × 127, so it is divisible by 2.
What are the factors of 57150?
1, 2, 3, 5, 6, 9, 10, 15, 18, 25, 30, 45, 50, 75, 90, 127, 150, 225, 254, 381, 450, 635, 762, 1143, 1270, 1905, 2286, 3175, 3810, 5715, 6350, 9525, 11430, 19050, 28575, 57150.
What is 57150 in binary?
1101111100111110 (hexadecimal DF3E, octal 157476).
What is the square root of 57150?
About 239.0607, exactly 15√254.
Is 57150 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 57150?
57150 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 18.