The number 55003
55003 is a composite number with 4 divisors. Its prime factorisation is 13 × 4231. Divisors (4): 1, 13, 4231, 55003.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 55003: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 4231, the product of two primes.
- 2
55003 is composite. Its prime factorisation is
- 3
The divisors add up to 59248; without 55003 itself that is 4245, so 55003 is deficient (4245 is less than 55003). Euler's totient φ(55003) = 50760 numbers up to 55003 share no factor with it.
- 4
The digits of 55003 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 215 steps to reach 1.
LaTeX source of the formulas on this page
\[ 55003 = 13 \times 4231 \]
55003 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59248 |
| Euler totient φ(n) | 50760 |
| Square | 3025330009 |
| Cube | 166402226485027 |
| Square root | 234.527184 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 215 |
| Scientific notation | 5.5003 × |
55003 in other forms
| Form | Value |
|---|---|
| In words | fifty-five thousand and three |
| Binary (base 2) | 1101011011011011 |
| Octal (base 8) | 153333 |
| Hexadecimal (base 16) | D6DB |
| Base 3 | 2210110011 |
| As time | 55003 seconds = 15 h 16 min 43 s |
Is 55003 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 55003 a prime number?
No. 55003 = 13 × 4231, so it is divisible by 13.
What are the factors of 55003?
1, 13, 4231, 55003.
What is 55003 in binary?
1101011011011011 (hexadecimal D6DB, octal 153333).
What is the square root of 55003?
About 234.5272.
Is 55003 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 55003?
55003 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 4231, the product of two primes.