The number 51980
51980 is a composite number with 24 divisors. Its prime factorisation is × 5 × 23 × 113. Divisors (24): 1, 2, 4, 5, 10, 20, 23, 46, 92, 113, 115, 226, 230, 452, 460, 565 … 51980.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51980: a Harshad number: divisible by its digit sum 23.
- 2
51980 is composite. Its prime factorisation is
- 3
The divisors add up to 114912; without 51980 itself that is 62932, so 51980 is abundant (62932 is more than 51980). Euler's totient φ(51980) = 19712 numbers up to 51980 share no factor with it.
- 4
The digits of 51980 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 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51980 = 2^{2} \times 5 \times 23 \times 113 \]51980 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 114912 |
| Euler totient φ(n) | 19712 |
| Square | 2701920400 |
| Cube | 140445822392000 |
| Square root | 227.991228 (= 2√12995) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 127 |
| Scientific notation | 5.198 × |
51980 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand nine hundred and eighty |
| Binary (base 2) | 1100101100001100 |
| Octal (base 8) | 145414 |
| Hexadecimal (base 16) | CB0C |
| Base 3 | 2122022012 |
| As time | 51980 seconds = 14 h 26 min 20 s |
Is 51980 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51980 ÷ 2 = 25990) | 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 (51980 ÷ 4 = 12995) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (51980 ÷ 5 = 10396) | 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 | No (remainder 4) | 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 | Yes (51980 ÷ 10 = 5198) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 51980 a prime number?
No. 51980 = × 5 × 23 × 113, so it is divisible by 2.
What are the factors of 51980?
1, 2, 4, 5, 10, 20, 23, 46, 92, 113, 115, 226, 230, 452, 460, 565, 1130, 2260, 2599, 5198, 10396, 12995, 25990, 51980.
What is 51980 in binary?
1100101100001100 (hexadecimal CB0C, octal 145414).
What is the square root of 51980?
About 227.9912, exactly 2√12995.
Is 51980 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 51980?
51980 is a Harshad number: divisible by its digit sum 23.