The number 12560
12560 is a composite number with 20 divisors. Its prime factorisation is × 5 × 157. Divisors (20): 1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 157, 314, 628, 785, 1256, 1570 … 12560.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12560 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12560 is composite. Its prime factorisation is
- 3
The divisors add up to 29388; without 12560 itself that is 16828, so 12560 is abundant (16828 is more than 12560). Euler's totient φ(12560) = 4992 numbers up to 12560 share no factor with it.
- 4
The digits of 12560 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 125 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12560 = 2^{4} \times 5 \times 157 \]12560 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 20 |
| Sum of divisors | 29388 |
| Euler totient φ(n) | 4992 |
| Square | 157753600 |
| Cube | 1981385216000 |
| Square root | 112.071406 (= 4√785) |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 125 |
| Scientific notation | 1.256 × |
12560 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand five hundred and sixty |
| Binary (base 2) | 11000100010000 |
| Octal (base 8) | 30420 |
| Hexadecimal (base 16) | 3110 |
| Base 3 | 122020012 |
| As time | 12560 seconds = 3 h 29 min 20 s |
Is 12560 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12560 ÷ 2 = 6280) | 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 (12560 ÷ 4 = 3140) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12560 ÷ 5 = 2512) | 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 | Yes (12560 ÷ 8 = 1570) | 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 (12560 ÷ 10 = 1256) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 12560 a prime number?
No. 12560 = × 5 × 157, so it is divisible by 2.
What are the factors of 12560?
1, 2, 4, 5, 8, 10, 16, 20, 40, 80, 157, 314, 628, 785, 1256, 1570, 2512, 3140, 6280, 12560.
What is 12560 in binary?
11000100010000 (hexadecimal 3110, octal 30420).
What is the square root of 12560?
About 112.0714, exactly 4√785.
Is 12560 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 12560?
It is a composite number with 20 divisors.