The number 50892
50892 is a composite number with 12 divisors. Its prime factorisation is × 3 × 4241. Divisors (12): 1, 2, 3, 4, 6, 12, 4241, 8482, 12723, 16964, 25446, 50892.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50892 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50892 is composite. Its prime factorisation is
- 3
The divisors add up to 118776; without 50892 itself that is 67884, so 50892 is abundant (67884 is more than 50892). Euler's totient φ(50892) = 16960 numbers up to 50892 share no factor with it.
- 4
The digits of 50892 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50892 = 2^{2} \times 3 \times 4241 \]50892 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 118776 |
| Euler totient φ(n) | 16960 |
| Square | 2589995664 |
| Cube | 131810059332288 |
| Square root | 225.592553 (= 2√12723) |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0892 × |
50892 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand eight hundred and ninety-two |
| Binary (base 2) | 1100011011001100 |
| Octal (base 8) | 143314 |
| Hexadecimal (base 16) | C6CC |
| Base 3 | 2120210220 |
| As time | 50892 seconds = 14 h 8 min 12 s |
Is 50892 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50892 ÷ 2 = 25446) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50892 ÷ 3 = 16964) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50892 ÷ 4 = 12723) | 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 (50892 ÷ 6 = 8482) | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (50892 ÷ 12 = 4241) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50892 a prime number?
No. 50892 = × 3 × 4241, so it is divisible by 2.
What are the factors of 50892?
1, 2, 3, 4, 6, 12, 4241, 8482, 12723, 16964, 25446, 50892.
What is 50892 in binary?
1100011011001100 (hexadecimal C6CC, octal 143314).
What is the square root of 50892?
About 225.5926, exactly 2√12723.
Is 50892 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 50892?
It is a composite number with 12 divisors.