The number 51560
51560 is a composite number with 16 divisors. Its prime factorisation is × 5 × 1289. Divisors (16): 1, 2, 4, 5, 8, 10, 20, 40, 1289, 2578, 5156, 6445, 10312, 12890, 25780, 51560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51560 is composite. Its prime factorisation is
- 3
The divisors add up to 116100; without 51560 itself that is 64540, so 51560 is abundant (64540 is more than 51560). Euler's totient φ(51560) = 20608 numbers up to 51560 share no factor with it.
- 4
The digits of 51560 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 26 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51560 = 2^{3} \times 5 \times 1289 \]51560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 116100 |
| Euler totient φ(n) | 20608 |
| Square | 2658433600 |
| Cube | 137068836416000 |
| Square root | 227.068272 (= 2√12890) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 26 |
| Scientific notation | 5.156 × |
51560 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and sixty |
| Binary (base 2) | 1100100101101000 |
| Octal (base 8) | 144550 |
| Hexadecimal (base 16) | C968 |
| Base 3 | 2121201122 |
| As time | 51560 seconds = 14 h 19 min 20 s |
Is 51560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51560 ÷ 2 = 25780) | 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 (51560 ÷ 4 = 12890) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51560 ÷ 5 = 10312) | 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 5) | 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 (51560 ÷ 8 = 6445) | 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 | Yes (51560 ÷ 10 = 5156) | 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 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51560 a prime number?
No. 51560 = × 5 × 1289, so it is divisible by 2.
What are the factors of 51560?
1, 2, 4, 5, 8, 10, 20, 40, 1289, 2578, 5156, 6445, 10312, 12890, 25780, 51560.
What is 51560 in binary?
1100100101101000 (hexadecimal C968, octal 144550).
What is the square root of 51560?
About 227.0683, exactly 2√12890.
Is 51560 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 51560?
It is a composite number with 16 divisors.