The number 55650
55650 is a composite number with 48 divisors. Its prime factorisation is 2 × 3 × × 7 × 53. Divisors (48): 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 53 … 55650.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55650: a Harshad number: divisible by its digit sum 21.
- 2
55650 is composite. Its prime factorisation is
- 3
The divisors add up to 160704; without 55650 itself that is 105054, so 55650 is abundant (105054 is more than 55650). Euler's totient φ(55650) = 12480 numbers up to 55650 share no factor with it.
- 4
The digits of 55650 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55650 = 2 \times 3 \times 5^{2} \times 7 \times 53 \]55650 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 160704 |
| Euler totient φ(n) | 12480 |
| Square | 3096922500 |
| Cube | 172343737125000 |
| Square root | 235.902522 (= 5√2226) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.565 × |
55650 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand six hundred and fifty |
| Binary (base 2) | 1101100101100010 |
| Octal (base 8) | 154542 |
| Hexadecimal (base 16) | D962 |
| Base 3 | 2211100010 |
| As time | 55650 seconds = 15 h 27 min 30 s |
Is 55650 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55650 ÷ 2 = 27825) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55650 ÷ 3 = 18550) | 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 (55650 ÷ 5 = 11130) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (55650 ÷ 6 = 9275) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (55650 ÷ 7 = 7950) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55650 ÷ 10 = 5565) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 55650 a prime number?
No. 55650 = 2 × 3 × × 7 × 53, so it is divisible by 2.
What are the factors of 55650?
1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 25, 30, 35, 42, 50, 53, 70, 75, 105, 106, 150, 159, 175, 210, 265, 318, 350, 371, 525, 530, 742, 795, 1050, 1113, 1325, 1590, 1855, 2226, 2650, 3710, 3975, 5565, 7950, 9275, 11130, 18550, 27825, 55650.
What is 55650 in binary?
1101100101100010 (hexadecimal D962, octal 154542).
What is the square root of 55650?
About 235.9025, exactly 5√2226.
Is 55650 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55650?
55650 is a Harshad number: divisible by its digit sum 21.