The number 55050
55050 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 367. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 367, 734, 1101, 1835 … 55050.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55050: a Harshad number: divisible by its digit sum 15.
- 2
55050 is composite. Its prime factorisation is
- 3
The divisors add up to 136896; without 55050 itself that is 81846, so 55050 is abundant (81846 is more than 55050). Euler's totient φ(55050) = 14640 numbers up to 55050 share no factor with it.
- 4
The digits of 55050 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55050 = 2 \times 3 \times 5^{2} \times 367 \]55050 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 136896 |
| Euler totient φ(n) | 14640 |
| Square | 3030502500 |
| Cube | 166829162625000 |
| Square root | 234.627364 (= 5√2202) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.505 × |
55050 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and fifty |
| Binary (base 2) | 1101011100001010 |
| Octal (base 8) | 153412 |
| Hexadecimal (base 16) | D70A |
| Base 3 | 2210111220 |
| As time | 55050 seconds = 15 h 17 min 30 s |
Is 55050 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55050 ÷ 2 = 27525) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55050 ÷ 3 = 18350) | 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 (55050 ÷ 5 = 11010) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (55050 ÷ 6 = 9175) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55050 ÷ 10 = 5505) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55050 a prime number?
No. 55050 = 2 × 3 × × 367, so it is divisible by 2.
What are the factors of 55050?
1, 2, 3, 5, 6, 10, 15, 25, 30, 50, 75, 150, 367, 734, 1101, 1835, 2202, 3670, 5505, 9175, 11010, 18350, 27525, 55050.
What is 55050 in binary?
1101011100001010 (hexadecimal D70A, octal 153412).
What is the square root of 55050?
About 234.6274, exactly 5√2202.
Is 55050 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 55050?
55050 is a Harshad number: divisible by its digit sum 15.