The number 58064
58064 is a composite number with 20 divisors. Its prime factorisation is × 19 × 191. Divisors (20): 1, 2, 4, 8, 16, 19, 38, 76, 152, 191, 304, 382, 764, 1528, 3056, 3629 … 58064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
58064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
58064 is composite. Its prime factorisation is
- 3
The divisors add up to 119040; without 58064 itself that is 60976, so 58064 is abundant (60976 is more than 58064). Euler's totient φ(58064) = 27360 numbers up to 58064 share no factor with it.
- 4
The digits of 58064 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 58064 = 2^{4} \times 19 \times 191 \]58064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 119040 |
| Euler totient φ(n) | 27360 |
| Square | 3371428096 |
| Cube | 195758600966144 |
| Square root | 240.964728 (= 4√3629) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.8064 × |
58064 in other forms
| Form | Value |
|---|---|
| In words | fifty-eight thousand and sixty-four |
| Binary (base 2) | 1110001011010000 |
| Octal (base 8) | 161320 |
| Hexadecimal (base 16) | E2D0 |
| Base 3 | 2221122112 |
| As time | 58064 seconds = 16 h 7 min 44 s |
Is 58064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (58064 ÷ 2 = 29032) | 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 | Yes (58064 ÷ 4 = 14516) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 (58064 ÷ 8 = 7258) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 58064 a prime number?
No. 58064 = × 19 × 191, so it is divisible by 2.
What are the factors of 58064?
1, 2, 4, 8, 16, 19, 38, 76, 152, 191, 304, 382, 764, 1528, 3056, 3629, 7258, 14516, 29032, 58064.
What is 58064 in binary?
1110001011010000 (hexadecimal E2D0, octal 161320).
What is the square root of 58064?
About 240.9647, exactly 4√3629.
Is 58064 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 58064?
It is a composite number with 20 divisors.