The number 55055
55055 is a palindrome: it reads 55055 backwards too. Its prime factorisation is 5 × 7 × × 13. Divisors (24): 1, 5, 7, 11, 13, 35, 55, 65, 77, 91, 121, 143, 385, 455, 605, 715 … 55055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55055: a palindrome: it reads 55055 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55055 is composite. Its prime factorisation is
- 3
The divisors add up to 89376; without 55055 itself that is 34321, so 55055 is deficient (34321 is less than 55055). Euler's totient φ(55055) = 31680 numbers up to 55055 share no factor with it.
- 4
The digits of 55055 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 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55055 = 5 \times 7 \times 11^{2} \times 13 \]55055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 89376 |
| Euler totient φ(n) | 31680 |
| Square | 3031053025 |
| Cube | 166874624291375 |
| Square root | 234.638019 (= 11√455) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.5055 × |
55055 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and fifty-five |
| Binary (base 2) | 1101011100001111 |
| Octal (base 8) | 153417 |
| Hexadecimal (base 16) | D70F |
| Base 3 | 2210112002 |
| As time | 55055 seconds = 15 h 17 min 35 s |
Is 55055 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55055 ÷ 5 = 11011) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (55055 ÷ 7 = 7865) | 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 7) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55055 ÷ 11 = 5005) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55055 a prime number?
No. 55055 = 5 × 7 × × 13, so it is divisible by 5.
What are the factors of 55055?
1, 5, 7, 11, 13, 35, 55, 65, 77, 91, 121, 143, 385, 455, 605, 715, 847, 1001, 1573, 4235, 5005, 7865, 11011, 55055.
What is 55055 in binary?
1101011100001111 (hexadecimal D70F, octal 153417).
What is the square root of 55055?
About 234.6380, exactly 11√455.
Is 55055 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 55055?
55055 is a palindrome: it reads 55055 backwards too; a happy number: repeatedly adding the squares of its digits reaches 1.