The number 55964
55964 is a composite number with 12 divisors. Its prime factorisation is × 17 × 823. Divisors (12): 1, 2, 4, 17, 34, 68, 823, 1646, 3292, 13991, 27982, 55964.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55964 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55964 is composite. Its prime factorisation is
- 3
The divisors add up to 103824; without 55964 itself that is 47860, so 55964 is deficient (47860 is less than 55964). Euler's totient φ(55964) = 26304 numbers up to 55964 share no factor with it.
- 4
The digits of 55964 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55964 = 2^{2} \times 17 \times 823 \]55964 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 103824 |
| Euler totient φ(n) | 26304 |
| Square | 3131969296 |
| Cube | 175277529681344 |
| Square root | 236.567115 (= 2√13991) |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5964 × |
55964 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and sixty-four |
| Binary (base 2) | 1101101010011100 |
| Octal (base 8) | 155234 |
| Hexadecimal (base 16) | DA9C |
| Base 3 | 2211202202 |
| As time | 55964 seconds = 15 h 32 min 44 s |
Is 55964 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55964 ÷ 2 = 27982) | 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 (55964 ÷ 4 = 13991) | 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 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 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 7) | 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 55964 a prime number?
No. 55964 = × 17 × 823, so it is divisible by 2.
What are the factors of 55964?
1, 2, 4, 17, 34, 68, 823, 1646, 3292, 13991, 27982, 55964.
What is 55964 in binary?
1101101010011100 (hexadecimal DA9C, octal 155234).
What is the square root of 55964?
About 236.5671, exactly 2√13991.
Is 55964 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55964?
It is a composite number with 12 divisors.