The number 55550
55550 is a composite number with 24 divisors. Its prime factorisation is 2 × × 11 × 101. Divisors (24): 1, 2, 5, 10, 11, 22, 25, 50, 55, 101, 110, 202, 275, 505, 550, 1010 … 55550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55550: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55550 is composite. Its prime factorisation is
- 3
The divisors add up to 113832; without 55550 itself that is 58282, so 55550 is abundant (58282 is more than 55550). Euler's totient φ(55550) = 20000 numbers up to 55550 share no factor with it.
- 4
The digits of 55550 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 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55550 = 2 \times 5^{2} \times 11 \times 101 \]55550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 113832 |
| Euler totient φ(n) | 20000 |
| Square | 3085802500 |
| Cube | 171416328875000 |
| Square root | 235.690475 (= 5√2222) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.555 × |
55550 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and fifty |
| Binary (base 2) | 1101100011111110 |
| Octal (base 8) | 154376 |
| Hexadecimal (base 16) | D8FE |
| Base 3 | 2211012102 |
| As time | 55550 seconds = 15 h 25 min 50 s |
Is 55550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55550 ÷ 2 = 27775) | 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 (55550 ÷ 5 = 11110) | 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 5) | 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 (55550 ÷ 10 = 5555) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55550 ÷ 11 = 5050) | 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 55550 a prime number?
No. 55550 = 2 × × 11 × 101, so it is divisible by 2.
What are the factors of 55550?
1, 2, 5, 10, 11, 22, 25, 50, 55, 101, 110, 202, 275, 505, 550, 1010, 1111, 2222, 2525, 5050, 5555, 11110, 27775, 55550.
What is 55550 in binary?
1101100011111110 (hexadecimal D8FE, octal 154376).
What is the square root of 55550?
About 235.6905, exactly 5√2222.
Is 55550 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55550?
55550 is a happy number: repeatedly adding the squares of its digits reaches 1.