The number 50082
50082 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 17 × 491. Divisors (16): 1, 2, 3, 6, 17, 34, 51, 102, 491, 982, 1473, 2946, 8347, 16694, 25041, 50082.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50082 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50082 is composite. Its prime factorisation is
- 3
The divisors add up to 106272; without 50082 itself that is 56190, so 50082 is abundant (56190 is more than 50082). Euler's totient φ(50082) = 15680 numbers up to 50082 share no factor with it.
- 4
The digits of 50082 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 114 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50082 = 2 \times 3 \times 17 \times 491 \]
50082 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 106272 |
| Euler totient φ(n) | 15680 |
| Square | 2508206724 |
| Cube | 125616009151368 |
| Square root | 223.790080 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 114 |
| Scientific notation | 5.0082 × |
50082 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand and eighty-two |
| Binary (base 2) | 1100001110100010 |
| Octal (base 8) | 141642 |
| Hexadecimal (base 16) | C3A2 |
| Base 3 | 2112200220 |
| As time | 50082 seconds = 13 h 54 min 42 s |
Is 50082 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50082 ÷ 2 = 25041) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50082 ÷ 3 = 16694) | 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 (50082 ÷ 6 = 8347) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 10) | 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 50082 a prime number?
No. 50082 = 2 × 3 × 17 × 491, so it is divisible by 2.
What are the factors of 50082?
1, 2, 3, 6, 17, 34, 51, 102, 491, 982, 1473, 2946, 8347, 16694, 25041, 50082.
What is 50082 in binary?
1100001110100010 (hexadecimal C3A2, octal 141642).
What is the square root of 50082?
About 223.7901.
Is 50082 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 50082?
It is a composite number with 16 divisors.