The number 50103
50103 is a composite number with 12 divisors. Its prime factorisation is × 19 × 293. Divisors (12): 1, 3, 9, 19, 57, 171, 293, 879, 2637, 5567, 16701, 50103.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50103: a Harshad number: divisible by its digit sum 9.
- 2
50103 is composite. Its prime factorisation is
- 3
The divisors add up to 76440; without 50103 itself that is 26337, so 50103 is deficient (26337 is less than 50103). Euler's totient φ(50103) = 31536 numbers up to 50103 share no factor with it.
- 4
The digits of 50103 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50103 = 3^{2} \times 19 \times 293 \]50103 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 76440 |
| Euler totient φ(n) | 31536 |
| Square | 2510310609 |
| Cube | 125774092442727 |
| Square root | 223.836994 (= 3√5567) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.0103 × |
50103 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and three |
| Binary (base 2) | 1100001110110111 |
| Octal (base 8) | 141667 |
| Hexadecimal (base 16) | C3B7 |
| Base 3 | 2112201200 |
| As time | 50103 seconds = 13 h 55 min 3 s |
Is 50103 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 (50103 ÷ 3 = 16701) | 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 | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50103 ÷ 9 = 5567) | 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 9) | 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 50103 a prime number?
No. 50103 = × 19 × 293, so it is divisible by 3.
What are the factors of 50103?
1, 3, 9, 19, 57, 171, 293, 879, 2637, 5567, 16701, 50103.
What is 50103 in binary?
1100001110110111 (hexadecimal C3B7, octal 141667).
What is the square root of 50103?
About 223.8370, exactly 3√5567.
Is 50103 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50103?
50103 is a Harshad number: divisible by its digit sum 9.