The number 55010
55010 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 5501. Divisors (8): 1, 2, 5, 10, 5501, 11002, 27505, 55010.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55010 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55010 is composite. Its prime factorisation is
- 3
The divisors add up to 99036; without 55010 itself that is 44026, so 55010 is deficient (44026 is less than 55010). Euler's totient φ(55010) = 22000 numbers up to 55010 share no factor with it.
- 4
The digits of 55010 add up to 11, 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
\[ 55010 = 2 \times 5 \times 5501 \]
55010 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 99036 |
| Euler totient φ(n) | 22000 |
| Square | 3026100100 |
| Cube | 166465766501000 |
| Square root | 234.542107 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.501 × |
55010 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and ten |
| Binary (base 2) | 1101011011100010 |
| Octal (base 8) | 153342 |
| Hexadecimal (base 16) | D6E2 |
| Base 3 | 2210110102 |
| As time | 55010 seconds = 15 h 16 min 50 s |
Is 55010 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55010 ÷ 2 = 27505) | 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 (55010 ÷ 5 = 11002) | 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 4) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55010 ÷ 10 = 5501) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55010 a prime number?
No. 55010 = 2 × 5 × 5501, so it is divisible by 2.
What are the factors of 55010?
1, 2, 5, 10, 5501, 11002, 27505, 55010.
What is 55010 in binary?
1101011011100010 (hexadecimal D6E2, octal 153342).
What is the square root of 55010?
About 234.5421.
Is 55010 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 55010?
It is a composite number with 8 divisors.