The number 56964
56964 is a composite number with 24 divisors. Its prime factorisation is × 3 × 47 × 101. Divisors (24): 1, 2, 3, 4, 6, 12, 47, 94, 101, 141, 188, 202, 282, 303, 404, 564 … 56964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
56964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
56964 is composite. Its prime factorisation is
- 3
The divisors add up to 137088; without 56964 itself that is 80124, so 56964 is abundant (80124 is more than 56964). Euler's totient φ(56964) = 18400 numbers up to 56964 share no factor with it.
- 4
The digits of 56964 add up to 30, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 56964 = 2^{2} \times 3 \times 47 \times 101 \]56964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 137088 |
| Euler totient φ(n) | 18400 |
| Square | 3244897296 |
| Cube | 184842329569344 |
| Square root | 238.671322 (= 2√14241) |
| Digit sum / digital root | 30 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.6964 × |
56964 in other forms
| Form | Value |
|---|---|
| In words | fifty-six thousand nine hundred and sixty-four |
| Binary (base 2) | 1101111010000100 |
| Octal (base 8) | 157204 |
| Hexadecimal (base 16) | DE84 |
| Base 3 | 2220010210 |
| As time | 56964 seconds = 15 h 49 min 24 s |
Is 56964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (56964 ÷ 2 = 28482) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (56964 ÷ 3 = 18988) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (56964 ÷ 4 = 14241) | 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 (56964 ÷ 6 = 9494) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (56964 ÷ 12 = 4747) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 56964 a prime number?
No. 56964 = × 3 × 47 × 101, so it is divisible by 2.
What are the factors of 56964?
1, 2, 3, 4, 6, 12, 47, 94, 101, 141, 188, 202, 282, 303, 404, 564, 606, 1212, 4747, 9494, 14241, 18988, 28482, 56964.
What is 56964 in binary?
1101111010000100 (hexadecimal DE84, octal 157204).
What is the square root of 56964?
About 238.6713, exactly 2√14241.
Is 56964 divisible by 3?
Yes. Its digits add up to 30, a multiple of 3.
What is special about the number 56964?
It is a composite number with 24 divisors.