The number 8964
8964 is a composite number with 24 divisors. Its prime factorisation is × × 83. Divisors (24): 1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 83, 108, 166, 249, 332 … 8964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8964: a Harshad number: divisible by its digit sum 27.
- 2
8964 is composite. Its prime factorisation is
- 3
The divisors add up to 23520; without 8964 itself that is 14556, so 8964 is abundant (14556 is more than 8964). Euler's totient φ(8964) = 2952 numbers up to 8964 share no factor with it.
- 4
The digits of 8964 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 8964 = 2^{2} \times 3^{3} \times 83 \]8964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 23520 |
| Euler totient φ(n) | 2952 |
| Square | 80353296 |
| Cube | 720286945344 |
| Square root | 94.678403 (= 6√249) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 47 |
| Scientific notation | 8.964 × |
8964 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and sixty-four |
| Binary (base 2) | 10001100000100 |
| Octal (base 8) | 21404 |
| Hexadecimal (base 16) | 2304 |
| Base 3 | 110022000 |
| As time | 8964 seconds = 2 h 29 min 24 s |
Is 8964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (8964 ÷ 2 = 4482) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (8964 ÷ 3 = 2988) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (8964 ÷ 4 = 2241) | 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 | Yes (8964 ÷ 6 = 1494) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (8964 ÷ 9 = 996) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (8964 ÷ 12 = 747) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8964 a prime number?
No. 8964 = × × 83, so it is divisible by 2.
What are the factors of 8964?
1, 2, 3, 4, 6, 9, 12, 18, 27, 36, 54, 83, 108, 166, 249, 332, 498, 747, 996, 1494, 2241, 2988, 4482, 8964.
What is 8964 in binary?
10001100000100 (hexadecimal 2304, octal 21404).
What is the square root of 8964?
About 94.6784, exactly 6√249.
Is 8964 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 8964?
8964 is a Harshad number: divisible by its digit sum 27.