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