The number 50202
50202 is a composite number with 12 divisors. Its prime factorisation is 2 × × 2789. Divisors (12): 1, 2, 3, 6, 9, 18, 2789, 5578, 8367, 16734, 25101, 50202.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50202: a Harshad number: divisible by its digit sum 9.
- 2
50202 is composite. Its prime factorisation is
- 3
The divisors add up to 108810; without 50202 itself that is 58608, so 50202 is abundant (58608 is more than 50202). Euler's totient φ(50202) = 16728 numbers up to 50202 share no factor with it.
- 4
The digits of 50202 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50202 = 2 \times 3^{2} \times 2789 \]50202 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 108810 |
| Euler totient φ(n) | 16728 |
| Square | 2520240804 |
| Cube | 126521128842408 |
| Square root | 224.058028 (= 3√5578) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 39 |
| Scientific notation | 5.0202 × |
50202 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and two |
| Binary (base 2) | 1100010000011010 |
| Octal (base 8) | 142032 |
| Hexadecimal (base 16) | C41A |
| Base 3 | 2112212100 |
| As time | 50202 seconds = 13 h 56 min 42 s |
Is 50202 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50202 ÷ 2 = 25101) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50202 ÷ 3 = 16734) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (50202 ÷ 6 = 8367) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50202 ÷ 9 = 5578) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50202 a prime number?
No. 50202 = 2 × × 2789, so it is divisible by 2.
What are the factors of 50202?
1, 2, 3, 6, 9, 18, 2789, 5578, 8367, 16734, 25101, 50202.
What is 50202 in binary?
1100010000011010 (hexadecimal C41A, octal 142032).
What is the square root of 50202?
About 224.0580, exactly 3√5578.
Is 50202 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 50202?
50202 is a Harshad number: divisible by its digit sum 9.