The number 55759
55759 is a composite number with 8 divisors. Its prime factorisation is 11 × 37 × 137. Divisors (8): 1, 11, 37, 137, 407, 1507, 5069, 55759.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55759 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55759 is composite. Its prime factorisation is
- 3
The divisors add up to 62928; without 55759 itself that is 7169, so 55759 is deficient (7169 is less than 55759). Euler's totient φ(55759) = 48960 numbers up to 55759 share no factor with it.
- 4
The digits of 55759 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 135 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55759 = 11 \times 37 \times 137 \]
55759 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 62928 |
| Euler totient φ(n) | 48960 |
| Square | 3109066081 |
| Cube | 173358415610479 |
| Square root | 236.133437 |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 135 |
| Scientific notation | 5.5759 × |
55759 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand seven hundred and fifty-nine |
| Binary (base 2) | 1101100111001111 |
| Octal (base 8) | 154717 |
| Hexadecimal (base 16) | D9CF |
| Base 3 | 2211111011 |
| As time | 55759 seconds = 15 h 29 min 19 s |
Is 55759 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55759 ÷ 11 = 5069) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55759 a prime number?
No. 55759 = 11 × 37 × 137, so it is divisible by 11.
What are the factors of 55759?
1, 11, 37, 137, 407, 1507, 5069, 55759.
What is 55759 in binary?
1101100111001111 (hexadecimal D9CF, octal 154717).
What is the square root of 55759?
About 236.1334.
Is 55759 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 55759?
It is a composite number with 8 divisors.