The number 55005
55005 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 19 × 193. Divisors (16): 1, 3, 5, 15, 19, 57, 95, 193, 285, 579, 965, 2895, 3667, 11001, 18335, 55005.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55005: a Harshad number: divisible by its digit sum 15.
- 2
55005 is composite. Its prime factorisation is
- 3
The divisors add up to 93120; without 55005 itself that is 38115, so 55005 is deficient (38115 is less than 55005). Euler's totient φ(55005) = 27648 numbers up to 55005 share no factor with it.
- 4
The digits of 55005 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 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55005 = 3 \times 5 \times 19 \times 193 \]
55005 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93120 |
| Euler totient φ(n) | 27648 |
| Square | 3025550025 |
| Cube | 166420379125125 |
| Square root | 234.531448 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5005 × |
55005 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and five |
| Binary (base 2) | 1101011011011101 |
| Octal (base 8) | 153335 |
| Hexadecimal (base 16) | D6DD |
| Base 3 | 2210110020 |
| As time | 55005 seconds = 15 h 16 min 45 s |
Is 55005 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 (55005 ÷ 3 = 18335) | 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 (55005 ÷ 5 = 11001) | 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 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 5) | 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 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 55005 a prime number?
No. 55005 = 3 × 5 × 19 × 193, so it is divisible by 3.
What are the factors of 55005?
1, 3, 5, 15, 19, 57, 95, 193, 285, 579, 965, 2895, 3667, 11001, 18335, 55005.
What is 55005 in binary?
1101011011011101 (hexadecimal D6DD, octal 153335).
What is the square root of 55005?
About 234.5314.
Is 55005 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 55005?
55005 is a Harshad number: divisible by its digit sum 15.