The number 50576
50576 is a composite number with 20 divisors. Its prime factorisation is × 29 × 109. Divisors (20): 1, 2, 4, 8, 16, 29, 58, 109, 116, 218, 232, 436, 464, 872, 1744, 3161 … 50576.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
50576 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
50576 is composite. Its prime factorisation is
- 3
The divisors add up to 102300; without 50576 itself that is 51724, so 50576 is abundant (51724 is more than 50576). Euler's totient φ(50576) = 24192 numbers up to 50576 share no factor with it.
- 4
The digits of 50576 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50576 = 2^{4} \times 29 \times 109 \]50576 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 102300 |
| Euler totient φ(n) | 24192 |
| Square | 2557931776 |
| Cube | 129369957502976 |
| Square root | 224.891085 (= 4√3161) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.0576 × |
50576 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and seventy-six |
| Binary (base 2) | 1100010110010000 |
| Octal (base 8) | 142620 |
| Hexadecimal (base 16) | C590 |
| Base 3 | 2120101012 |
| As time | 50576 seconds = 14 h 2 min 56 s |
Is 50576 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50576 ÷ 2 = 25288) | 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 (50576 ÷ 4 = 12644) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 (50576 ÷ 8 = 6322) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 50576 a prime number?
No. 50576 = × 29 × 109, so it is divisible by 2.
What are the factors of 50576?
1, 2, 4, 8, 16, 29, 58, 109, 116, 218, 232, 436, 464, 872, 1744, 3161, 6322, 12644, 25288, 50576.
What is 50576 in binary?
1100010110010000 (hexadecimal C590, octal 142620).
What is the square root of 50576?
About 224.8911, exactly 4√3161.
Is 50576 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 50576?
It is a composite number with 20 divisors.