The number 57062
57062 is a composite number with 8 divisors. Its prime factorisation is 2 × 103 × 277. Divisors (8): 1, 2, 103, 206, 277, 554, 28531, 57062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57062 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57062 is composite. Its prime factorisation is
- 3
The divisors add up to 86736; without 57062 itself that is 29674, so 57062 is deficient (29674 is less than 57062). Euler's totient φ(57062) = 28152 numbers up to 57062 share no factor with it.
- 4
The digits of 57062 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57062 = 2 \times 103 \times 277 \]
57062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86736 |
| Euler totient φ(n) | 28152 |
| Square | 3256071844 |
| Cube | 185797971562328 |
| Square root | 238.876537 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.7062 × |
57062 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand and sixty-two |
| Binary (base 2) | 1101111011100110 |
| Octal (base 8) | 157346 |
| Hexadecimal (base 16) | DEE6 |
| Base 3 | 2220021102 |
| As time | 57062 seconds = 15 h 51 min 2 s |
Is 57062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57062 ÷ 2 = 28531) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57062 a prime number?
No. 57062 = 2 × 103 × 277, so it is divisible by 2.
What are the factors of 57062?
1, 2, 103, 206, 277, 554, 28531, 57062.
What is 57062 in binary?
1101111011100110 (hexadecimal DEE6, octal 157346).
What is the square root of 57062?
About 238.8765.
Is 57062 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 57062?
It is a composite number with 8 divisors.