The number 50912
50912 is a composite number with 24 divisors. Its prime factorisation is × 37 × 43. Divisors (24): 1, 2, 4, 8, 16, 32, 37, 43, 74, 86, 148, 172, 296, 344, 592, 688 … 50912.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50912 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50912 is composite. Its prime factorisation is
- 3
The divisors add up to 105336; without 50912 itself that is 54424, so 50912 is abundant (54424 is more than 50912). Euler's totient φ(50912) = 24192 numbers up to 50912 share no factor with it.
- 4
The digits of 50912 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50912 = 2^{5} \times 37 \times 43 \]50912 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 105336 |
| Euler totient φ(n) | 24192 |
| Square | 2592031744 |
| Cube | 131965520150528 |
| Square root | 225.636876 (= 4√3182) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.0912 × |
50912 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand nine hundred and twelve |
| Binary (base 2) | 1100011011100000 |
| Octal (base 8) | 143340 |
| Hexadecimal (base 16) | C6E0 |
| Base 3 | 2120211122 |
| As time | 50912 seconds = 14 h 8 min 32 s |
Is 50912 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50912 ÷ 2 = 25456) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50912 ÷ 4 = 12728) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 (50912 ÷ 8 = 6364) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50912 a prime number?
No. 50912 = × 37 × 43, so it is divisible by 2.
What are the factors of 50912?
1, 2, 4, 8, 16, 32, 37, 43, 74, 86, 148, 172, 296, 344, 592, 688, 1184, 1376, 1591, 3182, 6364, 12728, 25456, 50912.
What is 50912 in binary?
1100011011100000 (hexadecimal C6E0, octal 143340).
What is the square root of 50912?
About 225.6369, exactly 4√3182.
Is 50912 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 50912?
It is a composite number with 24 divisors.