The number 50292
50292 is a composite number with 36 divisors. Its prime factorisation is × × 11 × 127. Divisors (36): 1, 2, 3, 4, 6, 9, 11, 12, 18, 22, 33, 36, 44, 66, 99, 127 … 50292.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50292: a Harshad number: divisible by its digit sum 18.
- 2
50292 is composite. Its prime factorisation is
- 3
The divisors add up to 139776; without 50292 itself that is 89484, so 50292 is abundant (89484 is more than 50292). Euler's totient φ(50292) = 15120 numbers up to 50292 share no factor with it.
- 4
The digits of 50292 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
\[ 50292 = 2^{2} \times 3^{2} \times 11 \times 127 \]50292 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 36 |
| Sum of divisors | 139776 |
| Euler totient φ(n) | 15120 |
| Square | 2529285264 |
| Cube | 127202814497088 |
| Square root | 224.258779 (= 6√1397) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0292 × |
50292 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand two hundred and ninety-two |
| Binary (base 2) | 1100010001110100 |
| Octal (base 8) | 142164 |
| Hexadecimal (base 16) | C474 |
| Base 3 | 2112222200 |
| As time | 50292 seconds = 13 h 58 min 12 s |
Is 50292 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50292 ÷ 2 = 25146) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50292 ÷ 3 = 16764) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50292 ÷ 4 = 12573) | 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 (50292 ÷ 6 = 8382) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (50292 ÷ 9 = 5588) | 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 | Yes (50292 ÷ 11 = 4572) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50292 ÷ 12 = 4191) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50292 a prime number?
No. 50292 = × × 11 × 127, so it is divisible by 2.
What are the factors of 50292?
1, 2, 3, 4, 6, 9, 11, 12, 18, 22, 33, 36, 44, 66, 99, 127, 132, 198, 254, 381, 396, 508, 762, 1143, 1397, 1524, 2286, 2794, 4191, 4572, 5588, 8382, 12573, 16764, 25146, 50292.
What is 50292 in binary?
1100010001110100 (hexadecimal C474, octal 142164).
What is the square root of 50292?
About 224.2588, exactly 6√1397.
Is 50292 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 50292?
50292 is a Harshad number: divisible by its digit sum 18.