The number 94064
94064 is a composite number with 10 divisors. Its prime factorisation is × 5879. Divisors (10): 1, 2, 4, 8, 16, 5879, 11758, 23516, 47032, 94064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
94064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
94064 is composite. Its prime factorisation is
- 3
The divisors add up to 182280; without 94064 itself that is 88216, so 94064 is deficient (88216 is less than 94064). Euler's totient φ(94064) = 47024 numbers up to 94064 share no factor with it.
- 4
The digits of 94064 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 84 steps to reach 1.
LaTeX source of the formulas on this page
\[ 94064 = 2^{4} \times 5879 \]94064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 182280 |
| Euler totient φ(n) | 47024 |
| Square | 8848036096 |
| Cube | 832281667334144 |
| Square root | 306.698549 (= 4√5879) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 84 |
| Scientific notation | 9.4064 × |
94064 in other forms
| Form | Value |
|---|---|
| In words | ninety-four thousand and sixty-four |
| Binary (base 2) | 10110111101110000 |
| Octal (base 8) | 267560 |
| Hexadecimal (base 16) | 16F70 |
| Base 3 | 11210000212 |
| As time | 94064 seconds = 26 h 7 min 44 s |
Is 94064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (94064 ÷ 2 = 47032) | 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 (94064 ÷ 4 = 23516) | 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 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 | Yes (94064 ÷ 8 = 11758) | 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 3) | 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 94064 a prime number?
No. 94064 = × 5879, so it is divisible by 2.
What are the factors of 94064?
1, 2, 4, 8, 16, 5879, 11758, 23516, 47032, 94064.
What is 94064 in binary?
10110111101110000 (hexadecimal 16F70, octal 267560).
What is the square root of 94064?
About 306.6985, exactly 4√5879.
Is 94064 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 94064?
It is a composite number with 10 divisors.