The number 50322
50322 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 8387. Divisors (8): 1, 2, 3, 6, 8387, 16774, 25161, 50322.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50322 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50322 is composite. Its prime factorisation is
- 3
The divisors add up to 100656; without 50322 itself that is 50334, so 50322 is abundant (50334 is more than 50322). Euler's totient φ(50322) = 16772 numbers up to 50322 share no factor with it.
- 4
The digits of 50322 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50322 = 2 \times 3 \times 8387 \]
50322 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 100656 |
| Euler totient φ(n) | 16772 |
| Square | 2532303684 |
| Cube | 127430585986248 |
| Square root | 224.325656 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0322 × |
50322 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand three hundred and twenty-two |
| Binary (base 2) | 1100010010010010 |
| Octal (base 8) | 142222 |
| Hexadecimal (base 16) | C492 |
| Base 3 | 2120000210 |
| As time | 50322 seconds = 13 h 58 min 42 s |
Is 50322 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50322 ÷ 2 = 25161) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50322 ÷ 3 = 16774) | 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 (50322 ÷ 6 = 8387) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 3) | 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 8) | 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 50322 a prime number?
No. 50322 = 2 × 3 × 8387, so it is divisible by 2.
What are the factors of 50322?
1, 2, 3, 6, 8387, 16774, 25161, 50322.
What is 50322 in binary?
1100010010010010 (hexadecimal C492, octal 142222).
What is the square root of 50322?
About 224.3257.
Is 50322 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 50322?
It is a composite number with 8 divisors.