The number 55503
55503 is a composite number with 12 divisors. Its prime factorisation is × 7 × 881. Divisors (12): 1, 3, 7, 9, 21, 63, 881, 2643, 6167, 7929, 18501, 55503.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
55503 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
55503 is composite. Its prime factorisation is
- 3
The divisors add up to 91728; without 55503 itself that is 36225, so 55503 is deficient (36225 is less than 55503). Euler's totient φ(55503) = 31680 numbers up to 55503 share no factor with it.
- 4
The digits of 55503 add up to 18, 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
\[ 55503 = 3^{2} \times 7 \times 881 \]55503 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 91728 |
| Euler totient φ(n) | 31680 |
| Square | 3080583009 |
| Cube | 170981598748527 |
| Square root | 235.590747 (= 3√6167) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 140 |
| Scientific notation | 5.5503 × |
55503 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand five hundred and three |
| Binary (base 2) | 1101100011001111 |
| Octal (base 8) | 154317 |
| Hexadecimal (base 16) | D8CF |
| Base 3 | 2211010200 |
| As time | 55503 seconds = 15 h 25 min 3 s |
Is 55503 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 (55503 ÷ 3 = 18501) | 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 | Yes (55503 ÷ 7 = 7929) | 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 | Yes (55503 ÷ 9 = 6167) | 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 | No (remainder 8) | 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 55503 a prime number?
No. 55503 = × 7 × 881, so it is divisible by 3.
What are the factors of 55503?
1, 3, 7, 9, 21, 63, 881, 2643, 6167, 7929, 18501, 55503.
What is 55503 in binary?
1101100011001111 (hexadecimal D8CF, octal 154317).
What is the square root of 55503?
About 235.5907, exactly 3√6167.
Is 55503 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 55503?
It is a composite number with 12 divisors.