The number 55065
55065 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 3671. Divisors (8): 1, 3, 5, 15, 3671, 11013, 18355, 55065.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55065 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55065 is composite. Its prime factorisation is
- 3
The divisors add up to 88128; without 55065 itself that is 33063, so 55065 is deficient (33063 is less than 55065). Euler's totient φ(55065) = 29360 numbers up to 55065 share no factor with it.
- 4
The digits of 55065 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 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55065 = 3 \times 5 \times 3671 \]
55065 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 88128 |
| Euler totient φ(n) | 29360 |
| Square | 3032154225 |
| Cube | 166965572399625 |
| Square root | 234.659328 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.5065 × |
55065 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and sixty-five |
| Binary (base 2) | 1101011100011001 |
| Octal (base 8) | 153431 |
| Hexadecimal (base 16) | D719 |
| Base 3 | 2210112110 |
| As time | 55065 seconds = 15 h 17 min 45 s |
Is 55065 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 (55065 ÷ 3 = 18355) | 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 (55065 ÷ 5 = 11013) | 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 1) | 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 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 55065 a prime number?
No. 55065 = 3 × 5 × 3671, so it is divisible by 3.
What are the factors of 55065?
1, 3, 5, 15, 3671, 11013, 18355, 55065.
What is 55065 in binary?
1101011100011001 (hexadecimal D719, octal 153431).
What is the square root of 55065?
About 234.6593.
Is 55065 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55065?
It is a composite number with 8 divisors.