The number 50560
50560 is a composite number with 32 divisors. Its prime factorisation is × 5 × 79. Divisors (32): 1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 79, 80, 128, 158, 160 … 50560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 50560: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.
- 2
50560 is composite. Its prime factorisation is
- 3
The divisors add up to 122400; without 50560 itself that is 71840, so 50560 is abundant (71840 is more than 50560). Euler's totient φ(50560) = 19968 numbers up to 50560 share no factor with it.
- 4
The digits of 50560 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 50560 = 2^{7} \times 5 \times 79 \]50560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 122400 |
| Euler totient φ(n) | 19968 |
| Square | 2556313600 |
| Cube | 129247215616000 |
| Square root | 224.855509 (= 8√790) |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.056 × |
50560 in other forms
| Form | Value |
|---|---|
| In words | fifty thousand five hundred and sixty |
| Binary (base 2) | 1100010110000000 |
| Octal (base 8) | 142600 |
| Hexadecimal (base 16) | C580 |
| Base 3 | 2120100121 |
| As time | 50560 seconds = 14 h 2 min 40 s |
Is 50560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (50560 ÷ 2 = 25280) | 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 (50560 ÷ 4 = 12640) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (50560 ÷ 5 = 10112) | 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 6) | 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 (50560 ÷ 8 = 6320) | 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 | Yes (50560 ÷ 10 = 5056) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 50560 a prime number?
No. 50560 = × 5 × 79, so it is divisible by 2.
What are the factors of 50560?
1, 2, 4, 5, 8, 10, 16, 20, 32, 40, 64, 79, 80, 128, 158, 160, 316, 320, 395, 632, 640, 790, 1264, 1580, 2528, 3160, 5056, 6320, 10112, 12640, 25280, 50560.
What is 50560 in binary?
1100010110000000 (hexadecimal C580, octal 142600).
What is the square root of 50560?
About 224.8555, exactly 8√790.
Is 50560 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 50560?
50560 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 16.