The number 55809
55809 is a composite number with 20 divisors. Its prime factorisation is × 13 × 53. Divisors (20): 1, 3, 9, 13, 27, 39, 53, 81, 117, 159, 351, 477, 689, 1053, 1431, 2067 … 55809.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55809: a Harshad number: divisible by its digit sum 27.
- 2
55809 is composite. Its prime factorisation is
- 3
The divisors add up to 91476; without 55809 itself that is 35667, so 55809 is deficient (35667 is less than 55809). Euler's totient φ(55809) = 33696 numbers up to 55809 share no factor with it.
- 4
The digits of 55809 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55809 = 3^{4} \times 13 \times 53 \]55809 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 91476 |
| Euler totient φ(n) | 33696 |
| Square | 3114644481 |
| Cube | 173825193840129 |
| Square root | 236.239285 (= 9√689) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.5809 × |
55809 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and nine |
| Binary (base 2) | 1101101000000001 |
| Octal (base 8) | 155001 |
| Hexadecimal (base 16) | DA01 |
| Base 3 | 2211120000 |
| As time | 55809 seconds = 15 h 30 min 9 s |
Is 55809 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 (55809 ÷ 3 = 18603) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 | Yes (55809 ÷ 9 = 6201) | 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 6) | 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 55809 a prime number?
No. 55809 = × 13 × 53, so it is divisible by 3.
What are the factors of 55809?
1, 3, 9, 13, 27, 39, 53, 81, 117, 159, 351, 477, 689, 1053, 1431, 2067, 4293, 6201, 18603, 55809.
What is 55809 in binary?
1101101000000001 (hexadecimal DA01, octal 155001).
What is the square root of 55809?
About 236.2393, exactly 9√689.
Is 55809 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 55809?
55809 is a Harshad number: divisible by its digit sum 27.