The number 50992
50992 is a composite number with 10 divisors. Its prime factorisation is × 3187. Divisors (10): 1, 2, 4, 8, 16, 3187, 6374, 12748, 25496, 50992.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50992 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50992 is composite. Its prime factorisation is
- 3
The divisors add up to 98828; without 50992 itself that is 47836, so 50992 is deficient (47836 is less than 50992). Euler's totient φ(50992) = 25488 numbers up to 50992 share no factor with it.
- 4
The digits of 50992 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50992 = 2^{4} \times 3187 \]50992 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 98828 |
| Euler totient φ(n) | 25488 |
| Square | 2600184064 |
| Cube | 132588585791488 |
| Square root | 225.814083 (= 4√3187) |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.0992 × |
50992 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and ninety-two |
| Binary (base 2) | 1100011100110000 |
| Octal (base 8) | 143460 |
| Hexadecimal (base 16) | C730 |
| Base 3 | 2120221121 |
| As time | 50992 seconds = 14 h 9 min 52 s |
Is 50992 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50992 ÷ 2 = 25496) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50992 ÷ 4 = 12748) | 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 4) | 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 | Yes (50992 ÷ 8 = 6374) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50992 a prime number?
No. 50992 = × 3187, so it is divisible by 2.
What are the factors of 50992?
1, 2, 4, 8, 16, 3187, 6374, 12748, 25496, 50992.
What is 50992 in binary?
1100011100110000 (hexadecimal C730, octal 143460).
What is the square root of 50992?
About 225.8141, exactly 4√3187.
Is 50992 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 50992?
It is a composite number with 10 divisors.