The number 4964
4964 is a composite number with 12 divisors. Its prime factorisation is × 17 × 73. Divisors (12): 1, 2, 4, 17, 34, 68, 73, 146, 292, 1241, 2482, 4964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
4964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
4964 is composite. Its prime factorisation is
- 3
The divisors add up to 9324; without 4964 itself that is 4360, so 4964 is deficient (4360 is less than 4964). Euler's totient φ(4964) = 2304 numbers up to 4964 share no factor with it.
- 4
The digits of 4964 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 4964 = 2^{2} \times 17 \times 73 \]4964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 9324 |
| Euler totient φ(n) | 2304 |
| Square | 24641296 |
| Cube | 122319393344 |
| Square root | 70.455660 (= 2√1241) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 41 |
| Scientific notation | 4.964 × |
4964 in other forms
| Form | Value |
|---|---|
| In words | four thousand nine hundred and sixty-four |
| Binary (base 2) | 1001101100100 |
| Octal (base 8) | 11544 |
| Hexadecimal (base 16) | 1364 |
| Base 3 | 20210212 |
| As time | 4964 seconds = 1 h 22 min 44 s |
Is 4964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (4964 ÷ 2 = 2482) | 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 (4964 ÷ 4 = 1241) | 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 1) | 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 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 4964 a prime number?
No. 4964 = × 17 × 73, so it is divisible by 2.
What are the factors of 4964?
1, 2, 4, 17, 34, 68, 73, 146, 292, 1241, 2482, 4964.
What is 4964 in binary?
1001101100100 (hexadecimal 1364, octal 11544).
What is the square root of 4964?
About 70.4557, exactly 2√1241.
Is 4964 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 4964?
It is a composite number with 12 divisors.