The number 50592
50592 is a composite number with 48 divisors. Its prime factorisation is × 3 × 17 × 31. Divisors (48): 1, 2, 3, 4, 6, 8, 12, 16, 17, 24, 31, 32, 34, 48, 51, 62 … 50592.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50592 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50592 is composite. Its prime factorisation is
- 3
The divisors add up to 145152; without 50592 itself that is 94560, so 50592 is abundant (94560 is more than 50592). Euler's totient φ(50592) = 15360 numbers up to 50592 share no factor with it.
- 4
The digits of 50592 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50592 = 2^{5} \times 3 \times 17 \times 31 \]50592 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 48 |
| Sum of divisors | 145152 |
| Euler totient φ(n) | 15360 |
| Square | 2559550464 |
| Cube | 129492777074688 |
| Square root | 224.926655 (= 4√3162) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.0592 × |
50592 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and ninety-two |
| Binary (base 2) | 1100010110100000 |
| Octal (base 8) | 142640 |
| Hexadecimal (base 16) | C5A0 |
| Base 3 | 2120101210 |
| As time | 50592 seconds = 14 h 3 min 12 s |
Is 50592 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50592 ÷ 2 = 25296) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (50592 ÷ 3 = 16864) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (50592 ÷ 4 = 12648) | 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 (50592 ÷ 6 = 8432) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (50592 ÷ 8 = 6324) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | 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 | Yes (50592 ÷ 12 = 4216) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50592 a prime number?
No. 50592 = × 3 × 17 × 31, so it is divisible by 2.
What are the factors of 50592?
1, 2, 3, 4, 6, 8, 12, 16, 17, 24, 31, 32, 34, 48, 51, 62, 68, 93, 96, 102, 124, 136, 186, 204, 248, 272, 372, 408, 496, 527, 544, 744, 816, 992, 1054, 1488, 1581, 1632, 2108, 2976, 3162, 4216, 6324, 8432, 12648, 16864, 25296, 50592.
What is 50592 in binary?
1100010110100000 (hexadecimal C5A0, octal 142640).
What is the square root of 50592?
About 224.9267, exactly 4√3162.
Is 50592 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 50592?
It is a composite number with 48 divisors.