The number 55806
55806 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 71 × 131. Divisors (16): 1, 2, 3, 6, 71, 131, 142, 213, 262, 393, 426, 786, 9301, 18602, 27903, 55806.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55806 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55806 is composite. Its prime factorisation is
- 3
The divisors add up to 114048; without 55806 itself that is 58242, so 55806 is abundant (58242 is more than 55806). Euler's totient φ(55806) = 18200 numbers up to 55806 share no factor with it.
- 4
The digits of 55806 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 91 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55806 = 2 \times 3 \times 71 \times 131 \]
55806 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 114048 |
| Euler totient φ(n) | 18200 |
| Square | 3114309636 |
| Cube | 173797163546616 |
| Square root | 236.232936 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 91 |
| Scientific notation | 5.5806 × |
55806 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and six |
| Binary (base 2) | 1101100111111110 |
| Octal (base 8) | 154776 |
| Hexadecimal (base 16) | D9FE |
| Base 3 | 2211112220 |
| As time | 55806 seconds = 15 h 30 min 6 s |
Is 55806 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (55806 ÷ 2 = 27903) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (55806 ÷ 3 = 18602) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (55806 ÷ 6 = 9301) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55806 a prime number?
No. 55806 = 2 × 3 × 71 × 131, so it is divisible by 2.
What are the factors of 55806?
1, 2, 3, 6, 71, 131, 142, 213, 262, 393, 426, 786, 9301, 18602, 27903, 55806.
What is 55806 in binary?
1101100111111110 (hexadecimal D9FE, octal 154776).
What is the square root of 55806?
About 236.2329.
Is 55806 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 55806?
It is a composite number with 16 divisors.