The number 55962
55962 is a composite number with 12 divisors. Its prime factorisation is 2 × × 3109. Divisors (12): 1, 2, 3, 6, 9, 18, 3109, 6218, 9327, 18654, 27981, 55962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55962 is composite. Its prime factorisation is
- 3
The divisors add up to 121290; without 55962 itself that is 65328, so 55962 is abundant (65328 is more than 55962). Euler's totient φ(55962) = 18648 numbers up to 55962 share no factor with it.
- 4
The digits of 55962 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55962 = 2 \times 3^{2} \times 3109 \]55962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 121290 |
| Euler totient φ(n) | 18648 |
| Square | 3131745444 |
| Cube | 175258738537128 |
| Square root | 236.562888 (= 3√6218) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.5962 × |
55962 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and sixty-two |
| Binary (base 2) | 1101101010011010 |
| Octal (base 8) | 155232 |
| Hexadecimal (base 16) | DA9A |
| Base 3 | 2211202200 |
| As time | 55962 seconds = 15 h 32 min 42 s |
Is 55962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55962 ÷ 2 = 27981) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55962 ÷ 3 = 18654) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (55962 ÷ 6 = 9327) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55962 ÷ 9 = 6218) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55962 a prime number?
No. 55962 = 2 × × 3109, so it is divisible by 2.
What are the factors of 55962?
1, 2, 3, 6, 9, 18, 3109, 6218, 9327, 18654, 27981, 55962.
What is 55962 in binary?
1101101010011010 (hexadecimal DA9A, octal 155232).
What is the square root of 55962?
About 236.5629, exactly 3√6218.
Is 55962 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55962?
It is a composite number with 12 divisors.