The number 55910
55910 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5591. Divisors (8): 1, 2, 5, 10, 5591, 11182, 27955, 55910.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55910 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55910 is composite. Its prime factorisation is
- 3
The divisors add up to 100656; without 55910 itself that is 44746, so 55910 is deficient (44746 is less than 55910). Euler's totient φ(55910) = 22360 numbers up to 55910 share no factor with it.
- 4
The digits of 55910 add up to 20, 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
\[ 55910 = 2 \times 5 \times 5591 \]
55910 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100656 |
| Euler totient φ(n) | 22360 |
| Square | 3125928100 |
| Cube | 174770640071000 |
| Square root | 236.452955 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.591 × |
55910 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand nine hundred and ten |
| Binary (base 2) | 1101101001100110 |
| Octal (base 8) | 155146 |
| Hexadecimal (base 16) | DA66 |
| Base 3 | 2211200202 |
| As time | 55910 seconds = 15 h 31 min 50 s |
Is 55910 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55910 ÷ 2 = 27955) | 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 | Yes (55910 ÷ 5 = 11182) | 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 1) | 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 | Yes (55910 ÷ 10 = 5591) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 55910 a prime number?
No. 55910 = 2 × 5 × 5591, so it is divisible by 2.
What are the factors of 55910?
1, 2, 5, 10, 5591, 11182, 27955, 55910.
What is 55910 in binary?
1101101001100110 (hexadecimal DA66, octal 155146).
What is the square root of 55910?
About 236.4530.
Is 55910 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55910?
It is a composite number with 8 divisors.