The number 55803
55803 is a composite number with 16 divisors. Its prime factorisation is 3 × 11 × 19 × 89. Divisors (16): 1, 3, 11, 19, 33, 57, 89, 209, 267, 627, 979, 1691, 2937, 5073, 18601, 55803.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55803 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55803 is composite. Its prime factorisation is
- 3
The divisors add up to 86400; without 55803 itself that is 30597, so 55803 is deficient (30597 is less than 55803). Euler's totient φ(55803) = 31680 numbers up to 55803 share no factor with it.
- 4
The digits of 55803 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55803 = 3 \times 11 \times 19 \times 89 \]
55803 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 86400 |
| Euler totient φ(n) | 31680 |
| Square | 3113974809 |
| Cube | 173769136266627 |
| Square root | 236.226586 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 60 |
| Scientific notation | 5.5803 × |
55803 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand eight hundred and three |
| Binary (base 2) | 1101100111111011 |
| Octal (base 8) | 154773 |
| Hexadecimal (base 16) | D9FB |
| Base 3 | 2211112210 |
| As time | 55803 seconds = 15 h 30 min 3 s |
Is 55803 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 (55803 ÷ 3 = 18601) | 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 3) | 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 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (55803 ÷ 11 = 5073) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55803 a prime number?
No. 55803 = 3 × 11 × 19 × 89, so it is divisible by 3.
What are the factors of 55803?
1, 3, 11, 19, 33, 57, 89, 209, 267, 627, 979, 1691, 2937, 5073, 18601, 55803.
What is 55803 in binary?
1101100111111011 (hexadecimal D9FB, octal 154773).
What is the square root of 55803?
About 236.2266.
Is 55803 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 55803?
It is a composite number with 16 divisors.