The number 65055
65055 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 4337. Divisors (8): 1, 3, 5, 15, 4337, 13011, 21685, 65055.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
65055 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
65055 is composite. Its prime factorisation is
- 3
The divisors add up to 104112; without 65055 itself that is 39057, so 65055 is deficient (39057 is less than 65055). Euler's totient φ(65055) = 34688 numbers up to 65055 share no factor with it.
- 4
The digits of 65055 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 205 steps to reach 1.
LaTeX source of the formulas on this page
\[ 65055 = 3 \times 5 \times 4337 \]
65055 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 104112 |
| Euler totient φ(n) | 34688 |
| Square | 4232153025 |
| Cube | 275322715041375 |
| Square root | 255.058817 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 205 |
| Scientific notation | 6.5055 × |
65055 in other forms
| Form | Value |
|---|---|
| In words | sixty-five thousand and fifty-five |
| Binary (base 2) | 1111111000011111 |
| Octal (base 8) | 177037 |
| Hexadecimal (base 16) | FE1F |
| Base 3 | 10022020110 |
| As time | 65055 seconds = 18 h 4 min 15 s |
Is 65055 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 (65055 ÷ 3 = 21685) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (65055 ÷ 5 = 13011) | 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 4) | 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 7) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 65055 a prime number?
No. 65055 = 3 × 5 × 4337, so it is divisible by 3.
What are the factors of 65055?
1, 3, 5, 15, 4337, 13011, 21685, 65055.
What is 65055 in binary?
1111111000011111 (hexadecimal FE1F, octal 177037).
What is the square root of 65055?
About 255.0588.
Is 65055 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 65055?
It is a composite number with 8 divisors.