The number 55485
55485 is a composite number with 20 divisors. Its prime factorisation is × 5 × 137. Divisors (20): 1, 3, 5, 9, 15, 27, 45, 81, 135, 137, 405, 411, 685, 1233, 2055, 3699 … 55485.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55485: a Harshad number: divisible by its digit sum 27.
- 2
55485 is composite. Its prime factorisation is
- 3
The divisors add up to 100188; without 55485 itself that is 44703, so 55485 is deficient (44703 is less than 55485). Euler's totient φ(55485) = 29376 numbers up to 55485 share no factor with it.
- 4
The digits of 55485 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55485 = 3^{4} \times 5 \times 137 \]55485 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 100188 |
| Euler totient φ(n) | 29376 |
| Square | 3078585225 |
| Cube | 170815301209125 |
| Square root | 235.552542 (= 9√685) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.5485 × |
55485 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand four hundred and eighty-five |
| Binary (base 2) | 1101100010111101 |
| Octal (base 8) | 154275 |
| Hexadecimal (base 16) | D8BD |
| Base 3 | 2211010000 |
| As time | 55485 seconds = 15 h 24 min 45 s |
Is 55485 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55485 ÷ 3 = 18495) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (55485 ÷ 5 = 11097) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (55485 ÷ 9 = 6165) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55485 a prime number?
No. 55485 = × 5 × 137, so it is divisible by 3.
What are the factors of 55485?
1, 3, 5, 9, 15, 27, 45, 81, 135, 137, 405, 411, 685, 1233, 2055, 3699, 6165, 11097, 18495, 55485.
What is 55485 in binary?
1101100010111101 (hexadecimal D8BD, octal 154275).
What is the square root of 55485?
About 235.5525, exactly 9√685.
Is 55485 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55485?
55485 is a Harshad number: divisible by its digit sum 27.