The number 51580
51580 is a composite number with 12 divisors. Its prime factorisation is × 5 × 2579. Divisors (12): 1, 2, 4, 5, 10, 20, 2579, 5158, 10316, 12895, 25790, 51580.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51580 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51580 is composite. Its prime factorisation is
- 3
The divisors add up to 108360; without 51580 itself that is 56780, so 51580 is abundant (56780 is more than 51580). Euler's totient φ(51580) = 20624 numbers up to 51580 share no factor with it.
- 4
The digits of 51580 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51580 = 2^{2} \times 5 \times 2579 \]51580 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 108360 |
| Euler totient φ(n) | 20624 |
| Square | 2660496400 |
| Cube | 137228404312000 |
| Square root | 227.112307 (= 2√12895) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.158 × |
51580 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and eighty |
| Binary (base 2) | 1100100101111100 |
| Octal (base 8) | 144574 |
| Hexadecimal (base 16) | C97C |
| Base 3 | 2121202101 |
| As time | 51580 seconds = 14 h 19 min 40 s |
Is 51580 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51580 ÷ 2 = 25790) | 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 (51580 ÷ 4 = 12895) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51580 ÷ 5 = 10316) | 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 4) | 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 | No (remainder 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51580 ÷ 10 = 5158) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 51580 a prime number?
No. 51580 = × 5 × 2579, so it is divisible by 2.
What are the factors of 51580?
1, 2, 4, 5, 10, 20, 2579, 5158, 10316, 12895, 25790, 51580.
What is 51580 in binary?
1100100101111100 (hexadecimal C97C, octal 144574).
What is the square root of 51580?
About 227.1123, exactly 2√12895.
Is 51580 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 51580?
It is a composite number with 12 divisors.