The number 20964
20964 is a composite number with 12 divisors. Its prime factorisation is × 3 × 1747. Divisors (12): 1, 2, 3, 4, 6, 12, 1747, 3494, 5241, 6988, 10482, 20964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20964 is composite. Its prime factorisation is
- 3
The divisors add up to 48944; without 20964 itself that is 27980, so 20964 is abundant (27980 is more than 20964). Euler's totient φ(20964) = 6984 numbers up to 20964 share no factor with it.
- 4
The digits of 20964 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20964 = 2^{2} \times 3 \times 1747 \]20964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 48944 |
| Euler totient φ(n) | 6984 |
| Square | 439489296 |
| Cube | 9213453601344 |
| Square root | 144.789502 (= 2√5241) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0964 × |
20964 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and sixty-four |
| Binary (base 2) | 101000111100100 |
| Octal (base 8) | 50744 |
| Hexadecimal (base 16) | 51E4 |
| Base 3 | 1001202110 |
| As time | 20964 seconds = 5 h 49 min 24 s |
Is 20964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20964 ÷ 2 = 10482) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (20964 ÷ 3 = 6988) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (20964 ÷ 4 = 5241) | 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 (20964 ÷ 6 = 3494) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (20964 ÷ 12 = 1747) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20964 a prime number?
No. 20964 = × 3 × 1747, so it is divisible by 2.
What are the factors of 20964?
1, 2, 3, 4, 6, 12, 1747, 3494, 5241, 6988, 10482, 20964.
What is 20964 in binary?
101000111100100 (hexadecimal 51E4, octal 50744).
What is the square root of 20964?
About 144.7895, exactly 2√5241.
Is 20964 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 20964?
It is a composite number with 12 divisors.