The number 50922
50922 is a composite number with 32 divisors. Its prime factorisation is 2 × × 23 × 41. Divisors (32): 1, 2, 3, 6, 9, 18, 23, 27, 41, 46, 54, 69, 82, 123, 138, 207 … 50922.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50922: a Harshad number: divisible by its digit sum 18.
- 2
50922 is composite. Its prime factorisation is
- 3
The divisors add up to 120960; without 50922 itself that is 70038, so 50922 is abundant (70038 is more than 50922). Euler's totient φ(50922) = 15840 numbers up to 50922 share no factor with it.
- 4
The digits of 50922 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50922 = 2 \times 3^{3} \times 23 \times 41 \]50922 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 120960 |
| Euler totient φ(n) | 15840 |
| Square | 2593050084 |
| Cube | 132043296377448 |
| Square root | 225.659035 (= 3√5658) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0922 × |
50922 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and twenty-two |
| Binary (base 2) | 1100011011101010 |
| Octal (base 8) | 143352 |
| Hexadecimal (base 16) | C6EA |
| Base 3 | 2120212000 |
| As time | 50922 seconds = 14 h 8 min 42 s |
Is 50922 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50922 ÷ 2 = 25461) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50922 ÷ 3 = 16974) | 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 (50922 ÷ 6 = 8487) | 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 | Yes (50922 ÷ 9 = 5658) | 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 3) | 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 50922 a prime number?
No. 50922 = 2 × × 23 × 41, so it is divisible by 2.
What are the factors of 50922?
1, 2, 3, 6, 9, 18, 23, 27, 41, 46, 54, 69, 82, 123, 138, 207, 246, 369, 414, 621, 738, 943, 1107, 1242, 1886, 2214, 2829, 5658, 8487, 16974, 25461, 50922.
What is 50922 in binary?
1100011011101010 (hexadecimal C6EA, octal 143352).
What is the square root of 50922?
About 225.6590, exactly 3√5658.
Is 50922 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50922?
50922 is a Harshad number: divisible by its digit sum 18.