The number 50162
50162 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 3583. Divisors (8): 1, 2, 7, 14, 3583, 7166, 25081, 50162.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50162: a Harshad number: divisible by its digit sum 14.
- 2
50162 is composite. Its prime factorisation is
- 3
The divisors add up to 86016; without 50162 itself that is 35854, so 50162 is deficient (35854 is less than 50162). Euler's totient φ(50162) = 21492 numbers up to 50162 share no factor with it.
- 4
The digits of 50162 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50162 = 2 \times 7 \times 3583 \]
50162 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 86016 |
| Euler totient φ(n) | 21492 |
| Square | 2516226244 |
| Cube | 126218940851528 |
| Square root | 223.968748 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0162 × |
50162 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand one hundred and sixty-two |
| Binary (base 2) | 1100001111110010 |
| Octal (base 8) | 141762 |
| Hexadecimal (base 16) | C3F2 |
| Base 3 | 2112210212 |
| As time | 50162 seconds = 13 h 56 min 2 s |
Is 50162 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50162 ÷ 2 = 25081) | 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 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 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (50162 ÷ 7 = 7166) | 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 | No (remainder 5) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50162 a prime number?
No. 50162 = 2 × 7 × 3583, so it is divisible by 2.
What are the factors of 50162?
1, 2, 7, 14, 3583, 7166, 25081, 50162.
What is 50162 in binary?
1100001111110010 (hexadecimal C3F2, octal 141762).
What is the square root of 50162?
About 223.9687.
Is 50162 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 50162?
50162 is a Harshad number: divisible by its digit sum 14.