The number 55982
55982 is a composite number with 8 divisors. Its prime factorisation is 2 × 23 × 1217. Divisors (8): 1, 2, 23, 46, 1217, 2434, 27991, 55982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55982 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55982 is composite. Its prime factorisation is
- 3
The divisors add up to 87696; without 55982 itself that is 31714, so 55982 is deficient (31714 is less than 55982). Euler's totient φ(55982) = 26752 numbers up to 55982 share no factor with it.
- 4
The digits of 55982 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 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55982 = 2 \times 23 \times 1217 \]
55982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 87696 |
| Euler totient φ(n) | 26752 |
| Square | 3133984324 |
| Cube | 175446710426168 |
| Square root | 236.605156 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5982 × |
55982 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and eighty-two |
| Binary (base 2) | 1101101010101110 |
| Octal (base 8) | 155256 |
| Hexadecimal (base 16) | DAAE |
| Base 3 | 2211210102 |
| As time | 55982 seconds = 15 h 33 min 2 s |
Is 55982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55982 ÷ 2 = 27991) | 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 | 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 6) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55982 a prime number?
No. 55982 = 2 × 23 × 1217, so it is divisible by 2.
What are the factors of 55982?
1, 2, 23, 46, 1217, 2434, 27991, 55982.
What is 55982 in binary?
1101101010101110 (hexadecimal DAAE, octal 155256).
What is the square root of 55982?
About 236.6052.
Is 55982 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 55982?
It is a composite number with 8 divisors.