The number 50822
50822 is a composite number with 4 divisors. Its prime factorisation is 2 × 25411. Divisors (4): 1, 2, 25411, 50822.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50822: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25411, the product of two primes.
- 2
50822 is composite. Its prime factorisation is
- 3
The divisors add up to 76236; without 50822 itself that is 25414, so 50822 is deficient (25414 is less than 50822). Euler's totient φ(50822) = 25410 numbers up to 50822 share no factor with it.
- 4
The digits of 50822 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 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50822 = 2 \times 25411 \]
50822 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 76236 |
| Euler totient φ(n) | 25410 |
| Square | 2582875684 |
| Cube | 131266908012248 |
| Square root | 225.437353 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0822 × |
50822 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and twenty-two |
| Binary (base 2) | 1100011010000110 |
| Octal (base 8) | 143206 |
| Hexadecimal (base 16) | C686 |
| Base 3 | 2120201022 |
| As time | 50822 seconds = 14 h 7 min 2 s |
Is 50822 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50822 ÷ 2 = 25411) | 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 2) | 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 6) | 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 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 50822 a prime number?
No. 50822 = 2 × 25411, so it is divisible by 2.
What are the factors of 50822?
1, 2, 25411, 50822.
What is 50822 in binary?
1100011010000110 (hexadecimal C686, octal 143206).
What is the square root of 50822?
About 225.4374.
Is 50822 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50822?
50822 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 25411, the product of two primes.