The number 12980
12980 is a composite number with 24 divisors. Its prime factorisation is × 5 × 11 × 59. Divisors (24): 1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 59, 110, 118, 220, 236, 295 … 12980.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12980: a Harshad number: divisible by its digit sum 20.
- 2
12980 is composite. Its prime factorisation is
- 3
The divisors add up to 30240; without 12980 itself that is 17260, so 12980 is abundant (17260 is more than 12980). Euler's totient φ(12980) = 4640 numbers up to 12980 share no factor with it.
- 4
The digits of 12980 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 138 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12980 = 2^{2} \times 5 \times 11 \times 59 \]12980 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 30240 |
| Euler totient φ(n) | 4640 |
| Square | 168480400 |
| Cube | 2186875592000 |
| Square root | 113.929803 (= 2√3245) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 138 |
| Scientific notation | 1.298 × |
12980 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand nine hundred and eighty |
| Binary (base 2) | 11001010110100 |
| Octal (base 8) | 31264 |
| Hexadecimal (base 16) | 32B4 |
| Base 3 | 122210202 |
| As time | 12980 seconds = 3 h 36 min 20 s |
Is 12980 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12980 ÷ 2 = 6490) | 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 (12980 ÷ 4 = 3245) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12980 ÷ 5 = 2596) | 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 2) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12980 ÷ 10 = 1298) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12980 ÷ 11 = 1180) | 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 12980 a prime number?
No. 12980 = × 5 × 11 × 59, so it is divisible by 2.
What are the factors of 12980?
1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 59, 110, 118, 220, 236, 295, 590, 649, 1180, 1298, 2596, 3245, 6490, 12980.
What is 12980 in binary?
11001010110100 (hexadecimal 32B4, octal 31264).
What is the square root of 12980?
About 113.9298, exactly 2√3245.
Is 12980 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 12980?
12980 is a Harshad number: divisible by its digit sum 20.