The number 10964
10964 is a composite number with 6 divisors. Its prime factorisation is × 2741. Divisors (6): 1, 2, 4, 2741, 5482, 10964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10964 is composite. Its prime factorisation is
- 3
The divisors add up to 19194; without 10964 itself that is 8230, so 10964 is deficient (8230 is less than 10964). Euler's totient φ(10964) = 5480 numbers up to 10964 share no factor with it.
- 4
The digits of 10964 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 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10964 = 2^{2} \times 2741 \]10964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 19194 |
| Euler totient φ(n) | 5480 |
| Square | 120209296 |
| Cube | 1317974721344 |
| Square root | 104.709121 (= 2√2741) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.0964 × |
10964 in other forms
| Form | Value |
|---|---|
| In words | ten thousand nine hundred and sixty-four |
| Binary (base 2) | 10101011010100 |
| Octal (base 8) | 25324 |
| Hexadecimal (base 16) | 2AD4 |
| Base 3 | 120001002 |
| As time | 10964 seconds = 3 h 2 min 44 s |
Is 10964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10964 ÷ 2 = 5482) | 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 (10964 ÷ 4 = 2741) | 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 2) | 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 | No (remainder 2) | 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 8) | 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 10964 a prime number?
No. 10964 = × 2741, so it is divisible by 2.
What are the factors of 10964?
1, 2, 4, 2741, 5482, 10964.
What is 10964 in binary?
10101011010100 (hexadecimal 2AD4, octal 25324).
What is the square root of 10964?
About 104.7091, exactly 2√2741.
Is 10964 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 10964?
It is a composite number with 6 divisors.