The number 50282
50282 is a composite number with 8 divisors. Its prime factorisation is 2 × 31 × 811. Divisors (8): 1, 2, 31, 62, 811, 1622, 25141, 50282.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50282: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
50282 is composite. Its prime factorisation is
- 3
The divisors add up to 77952; without 50282 itself that is 27670, so 50282 is deficient (27670 is less than 50282). Euler's totient φ(50282) = 24300 numbers up to 50282 share no factor with it.
- 4
The digits of 50282 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50282 = 2 \times 31 \times 811 \]
50282 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 77952 |
| Euler totient φ(n) | 24300 |
| Square | 2528279524 |
| Cube | 127126951025768 |
| Square root | 224.236482 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0282 × |
50282 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and eighty-two |
| Binary (base 2) | 1100010001101010 |
| Octal (base 8) | 142152 |
| Hexadecimal (base 16) | C46A |
| Base 3 | 2112222022 |
| As time | 50282 seconds = 13 h 58 min 2 s |
Is 50282 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50282 ÷ 2 = 25141) | 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 | No (remainder 1) | 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 8) | 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 1) | 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 50282 a prime number?
No. 50282 = 2 × 31 × 811, so it is divisible by 2.
What are the factors of 50282?
1, 2, 31, 62, 811, 1622, 25141, 50282.
What is 50282 in binary?
1100010001101010 (hexadecimal C46A, octal 142152).
What is the square root of 50282?
About 224.2365.
Is 50282 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50282?
50282 is a happy number: repeatedly adding the squares of its digits reaches 1.