The number 57051
57051 is a composite number with 8 divisors. Its prime factorisation is × 2113. Divisors (8): 1, 3, 9, 27, 2113, 6339, 19017, 57051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57051: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
57051 is composite. Its prime factorisation is
- 3
The divisors add up to 84560; without 57051 itself that is 27509, so 57051 is deficient (27509 is less than 57051). Euler's totient φ(57051) = 38016 numbers up to 57051 share no factor with it.
- 4
The digits of 57051 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57051 = 3^{3} \times 2113 \]57051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 84560 |
| Euler totient φ(n) | 38016 |
| Square | 3254816601 |
| Cube | 185690541903651 |
| Square root | 238.853512 (= 3√6339) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.7051 × |
57051 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand and fifty-one |
| Binary (base 2) | 1101111011011011 |
| Octal (base 8) | 157333 |
| Hexadecimal (base 16) | DEDB |
| Base 3 | 2220021000 |
| As time | 57051 seconds = 15 h 50 min 51 s |
Is 57051 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 (57051 ÷ 3 = 19017) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (57051 ÷ 9 = 6339) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57051 a prime number?
No. 57051 = × 2113, so it is divisible by 3.
What are the factors of 57051?
1, 3, 9, 27, 2113, 6339, 19017, 57051.
What is 57051 in binary?
1101111011011011 (hexadecimal DEDB, octal 157333).
What is the square root of 57051?
About 238.8535, exactly 3√6339.
Is 57051 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 57051?
57051 is a happy number: repeatedly adding the squares of its digits reaches 1.