The number 16964
16964 is a composite number with 6 divisors. Its prime factorisation is × 4241. Divisors (6): 1, 2, 4, 4241, 8482, 16964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16964 is composite. Its prime factorisation is
- 3
The divisors add up to 29694; without 16964 itself that is 12730, so 16964 is deficient (12730 is less than 16964). Euler's totient φ(16964) = 8480 numbers up to 16964 share no factor with it.
- 4
The digits of 16964 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16964 = 2^{2} \times 4241 \]16964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 29694 |
| Euler totient φ(n) | 8480 |
| Square | 287777296 |
| Cube | 4881854049344 |
| Square root | 130.245921 (= 2√4241) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 110 |
| Scientific notation | 1.6964 × |
16964 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand nine hundred and sixty-four |
| Binary (base 2) | 100001001000100 |
| Octal (base 8) | 41104 |
| Hexadecimal (base 16) | 4244 |
| Base 3 | 212021022 |
| As time | 16964 seconds = 4 h 42 min 44 s |
Is 16964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (16964 ÷ 2 = 8482) | 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 (16964 ÷ 4 = 4241) | 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 3) | 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 8) | 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 2) | 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 16964 a prime number?
No. 16964 = × 4241, so it is divisible by 2.
What are the factors of 16964?
1, 2, 4, 4241, 8482, 16964.
What is 16964 in binary?
100001001000100 (hexadecimal 4244, octal 41104).
What is the square root of 16964?
About 130.2459, exactly 2√4241.
Is 16964 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 16964?
It is a composite number with 6 divisors.