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