The number 55978
55978 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 2153. Divisors (8): 1, 2, 13, 26, 2153, 4306, 27989, 55978.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55978 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55978 is composite. Its prime factorisation is
- 3
The divisors add up to 90468; without 55978 itself that is 34490, so 55978 is deficient (34490 is less than 55978). Euler's totient φ(55978) = 25824 numbers up to 55978 share no factor with it.
- 4
The digits of 55978 add up to 34, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55978 = 2 \times 13 \times 2153 \]
55978 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 90468 |
| Euler totient φ(n) | 25824 |
| Square | 3133536484 |
| Cube | 175409105301352 |
| Square root | 236.596703 |
| Digit sum / digital root | 34 / 7 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.5978 × |
55978 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and seventy-eight |
| Binary (base 2) | 1101101010101010 |
| Octal (base 8) | 155252 |
| Hexadecimal (base 16) | DAAA |
| Base 3 | 2211210021 |
| As time | 55978 seconds = 15 h 32 min 58 s |
Is 55978 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55978 ÷ 2 = 27989) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55978 a prime number?
No. 55978 = 2 × 13 × 2153, so it is divisible by 2.
What are the factors of 55978?
1, 2, 13, 26, 2153, 4306, 27989, 55978.
What is 55978 in binary?
1101101010101010 (hexadecimal DAAA, octal 155252).
What is the square root of 55978?
About 236.5967.
Is 55978 divisible by 3?
No. Its digits add up to 34, which is not a multiple of 3.
What is special about the number 55978?
It is a composite number with 8 divisors.