The number 55330
55330 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 11 × 503. Divisors (16): 1, 2, 5, 10, 11, 22, 55, 110, 503, 1006, 2515, 5030, 5533, 11066, 27665, 55330.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55330: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
55330 is composite. Its prime factorisation is
- 3
The divisors add up to 108864; without 55330 itself that is 53534, so 55330 is deficient (53534 is less than 55330). Euler's totient φ(55330) = 20080 numbers up to 55330 share no factor with it.
- 4
The digits of 55330 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55330 = 2 \times 5 \times 11 \times 503 \]
55330 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 108864 |
| Euler totient φ(n) | 20080 |
| Square | 3061408900 |
| Cube | 169387754437000 |
| Square root | 235.223298 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 47 |
| Scientific notation | 5.533 × |
55330 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand three hundred and thirty |
| Binary (base 2) | 1101100000100010 |
| Octal (base 8) | 154042 |
| Hexadecimal (base 16) | D822 |
| Base 3 | 2210220021 |
| As time | 55330 seconds = 15 h 22 min 10 s |
Is 55330 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55330 ÷ 2 = 27665) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | 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 (55330 ÷ 5 = 11066) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (55330 ÷ 10 = 5533) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55330 ÷ 11 = 5030) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55330 a prime number?
No. 55330 = 2 × 5 × 11 × 503, so it is divisible by 2.
What are the factors of 55330?
1, 2, 5, 10, 11, 22, 55, 110, 503, 1006, 2515, 5030, 5533, 11066, 27665, 55330.
What is 55330 in binary?
1101100000100010 (hexadecimal D822, octal 154042).
What is the square root of 55330?
About 235.2233.
Is 55330 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 55330?
55330 is a happy number: repeatedly adding the squares of its digits reaches 1.