The number 57064
57064 is a composite number with 16 divisors. Its prime factorisation is × 7 × 1019. Divisors (16): 1, 2, 4, 7, 8, 14, 28, 56, 1019, 2038, 4076, 7133, 8152, 14266, 28532, 57064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57064 is composite. Its prime factorisation is
- 3
The divisors add up to 122400; without 57064 itself that is 65336, so 57064 is abundant (65336 is more than 57064). Euler's totient φ(57064) = 24432 numbers up to 57064 share no factor with it.
- 4
The digits of 57064 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57064 = 2^{3} \times 7 \times 1019 \]57064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 122400 |
| Euler totient φ(n) | 24432 |
| Square | 3256300096 |
| Cube | 185817508678144 |
| Square root | 238.880723 (= 2√14266) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.7064 × |
57064 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand and sixty-four |
| Binary (base 2) | 1101111011101000 |
| Octal (base 8) | 157350 |
| Hexadecimal (base 16) | DEE8 |
| Base 3 | 2220021111 |
| As time | 57064 seconds = 15 h 51 min 4 s |
Is 57064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57064 ÷ 2 = 28532) | 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 | Yes (57064 ÷ 4 = 14266) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | Yes (57064 ÷ 7 = 8152) | 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 | Yes (57064 ÷ 8 = 7133) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57064 a prime number?
No. 57064 = × 7 × 1019, so it is divisible by 2.
What are the factors of 57064?
1, 2, 4, 7, 8, 14, 28, 56, 1019, 2038, 4076, 7133, 8152, 14266, 28532, 57064.
What is 57064 in binary?
1101111011101000 (hexadecimal DEE8, octal 157350).
What is the square root of 57064?
About 238.8807, exactly 2√14266.
Is 57064 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 57064?
It is a composite number with 16 divisors.