The number 5550
5550 is a composite number with 24 divisors. Its prime factorisation is 2 × 3 × × 37. Divisors (24): 1, 2, 3, 5, 6, 10, 15, 25, 30, 37, 50, 74, 75, 111, 150, 185 … 5550.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5550: a Harshad number: divisible by its digit sum 15.
- 2
5550 is composite. Its prime factorisation is
- 3
The divisors add up to 14136; without 5550 itself that is 8586, so 5550 is abundant (8586 is more than 5550). Euler's totient φ(5550) = 1440 numbers up to 5550 share no factor with it.
- 4
The digits of 5550 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 67 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5550 = 2 \times 3 \times 5^{2} \times 37 \]5550 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 14136 |
| Euler totient φ(n) | 1440 |
| Square | 30802500 |
| Cube | 170953875000 |
| Square root | 74.498322 (= 5√222) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 67 |
| Scientific notation | 5.55 × |
5550 in other forms
| Form | Value |
|---|---|
| In words | five thousand five hundred and fifty |
| Binary (base 2) | 1010110101110 |
| Octal (base 8) | 12656 |
| Hexadecimal (base 16) | 15AE |
| Base 3 | 21121120 |
| As time | 5550 seconds = 1 h 32 min 30 s |
Is 5550 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5550 ÷ 2 = 2775) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5550 ÷ 3 = 1850) | 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 (5550 ÷ 5 = 1110) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5550 ÷ 6 = 925) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (5550 ÷ 10 = 555) | 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 5550 a prime number?
No. 5550 = 2 × 3 × × 37, so it is divisible by 2.
What are the factors of 5550?
1, 2, 3, 5, 6, 10, 15, 25, 30, 37, 50, 74, 75, 111, 150, 185, 222, 370, 555, 925, 1110, 1850, 2775, 5550.
What is 5550 in binary?
1010110101110 (hexadecimal 15AE, octal 12656).
What is the square root of 5550?
About 74.4983, exactly 5√222.
Is 5550 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5550?
5550 is a Harshad number: divisible by its digit sum 15.