The number 57058
57058 is a composite number with 8 divisors. Its prime factorisation is 2 × 47 × 607. Divisors (8): 1, 2, 47, 94, 607, 1214, 28529, 57058.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57058 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57058 is composite. Its prime factorisation is
- 3
The divisors add up to 87552; without 57058 itself that is 30494, so 57058 is deficient (30494 is less than 57058). Euler's totient φ(57058) = 27876 numbers up to 57058 share no factor with it.
- 4
The digits of 57058 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57058 = 2 \times 47 \times 607 \]
57058 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 87552 |
| Euler totient φ(n) | 27876 |
| Square | 3255615364 |
| Cube | 185758901439112 |
| Square root | 238.868164 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.7058 × |
57058 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand and fifty-eight |
| Binary (base 2) | 1101111011100010 |
| Octal (base 8) | 157342 |
| Hexadecimal (base 16) | DEE2 |
| Base 3 | 2220021021 |
| As time | 57058 seconds = 15 h 50 min 58 s |
Is 57058 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57058 ÷ 2 = 28529) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57058 a prime number?
No. 57058 = 2 × 47 × 607, so it is divisible by 2.
What are the factors of 57058?
1, 2, 47, 94, 607, 1214, 28529, 57058.
What is 57058 in binary?
1101111011100010 (hexadecimal DEE2, octal 157342).
What is the square root of 57058?
About 238.8682.
Is 57058 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 57058?
It is a composite number with 8 divisors.