The number 55765
55765 is a composite number with 8 divisors. Its prime factorisation is 5 × 19 × 587. Divisors (8): 1, 5, 19, 95, 587, 2935, 11153, 55765.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55765 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55765 is composite. Its prime factorisation is
- 3
The divisors add up to 70560; without 55765 itself that is 14795, so 55765 is deficient (14795 is less than 55765). Euler's totient φ(55765) = 42192 numbers up to 55765 share no factor with it.
- 4
The digits of 55765 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 184 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55765 = 5 \times 19 \times 587 \]
55765 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 70560 |
| Euler totient φ(n) | 42192 |
| Square | 3109735225 |
| Cube | 173414384822125 |
| Square root | 236.146141 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 184 |
| Scientific notation | 5.5765 × |
55765 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and sixty-five |
| Binary (base 2) | 1101100111010101 |
| Octal (base 8) | 154725 |
| Hexadecimal (base 16) | D9D5 |
| Base 3 | 2211111101 |
| As time | 55765 seconds = 15 h 29 min 25 s |
Is 55765 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 | No (remainder 1) | 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 (55765 ÷ 5 = 11153) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 | No (remainder 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55765 a prime number?
No. 55765 = 5 × 19 × 587, so it is divisible by 5.
What are the factors of 55765?
1, 5, 19, 95, 587, 2935, 11153, 55765.
What is 55765 in binary?
1101100111010101 (hexadecimal D9D5, octal 154725).
What is the square root of 55765?
About 236.1461.
Is 55765 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 55765?
It is a composite number with 8 divisors.