The number 50003
50003 is a composite number with 4 divisors. Its prime factorisation is 31 × 1613. Divisors (4): 1, 31, 1613, 50003.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50003: a semiprime: 31 × 1613, the product of two primes.
- 2
50003 is composite. Its prime factorisation is
- 3
The divisors add up to 51648; without 50003 itself that is 1645, so 50003 is deficient (1645 is less than 50003). Euler's totient φ(50003) = 48360 numbers up to 50003 share no factor with it.
- 4
The digits of 50003 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 52 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50003 = 31 \times 1613 \]
50003 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51648 |
| Euler totient φ(n) | 48360 |
| Square | 2500300009 |
| Cube | 125022501350027 |
| Square root | 223.613506 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 5.0003 × |
50003 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and three |
| Binary (base 2) | 1100001101010011 |
| Octal (base 8) | 141523 |
| Hexadecimal (base 16) | C353 |
| Base 3 | 2112120222 |
| As time | 50003 seconds = 13 h 53 min 23 s |
Is 50003 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 2) | 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 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50003 a prime number?
No. 50003 = 31 × 1613, so it is divisible by 31.
What are the factors of 50003?
1, 31, 1613, 50003.
What is 50003 in binary?
1100001101010011 (hexadecimal C353, octal 141523).
What is the square root of 50003?
About 223.6135.
Is 50003 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 50003?
50003 is a semiprime: 31 × 1613, the product of two primes.