The number 50803
50803 is a composite number with 4 divisors. Its prime factorisation is 101 × 503. Divisors (4): 1, 101, 503, 50803.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50803: a semiprime: 101 × 503, the product of two primes.
- 2
50803 is composite. Its prime factorisation is
- 3
The divisors add up to 51408; without 50803 itself that is 605, so 50803 is deficient (605 is less than 50803). Euler's totient φ(50803) = 50200 numbers up to 50803 share no factor with it.
- 4
The digits of 50803 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50803 = 101 \times 503 \]
50803 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51408 |
| Euler totient φ(n) | 50200 |
| Square | 2580944809 |
| Cube | 131119739131627 |
| Square root | 225.395208 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.0803 × |
50803 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and three |
| Binary (base 2) | 1100011001110011 |
| Octal (base 8) | 143163 |
| Hexadecimal (base 16) | C673 |
| Base 3 | 2120200121 |
| As time | 50803 seconds = 14 h 6 min 43 s |
Is 50803 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 7) | 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 5) | 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 50803 a prime number?
No. 50803 = 101 × 503, so it is divisible by 101.
What are the factors of 50803?
1, 101, 503, 50803.
What is 50803 in binary?
1100011001110011 (hexadecimal C673, octal 143163).
What is the square root of 50803?
About 225.3952.
Is 50803 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50803?
50803 is a semiprime: 101 × 503, the product of two primes.