The number 12160
12160 is a composite number with 32 divisors. Its prime factorisation is × 5 × 19. Divisors (32): 1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95 … 12160.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 12160: a Harshad number: divisible by its digit sum 10.
- 2
12160 is composite. Its prime factorisation is
- 3
The divisors add up to 30600; without 12160 itself that is 18440, so 12160 is abundant (18440 is more than 12160). Euler's totient φ(12160) = 4608 numbers up to 12160 share no factor with it.
- 4
The digits of 12160 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12160 = 2^{7} \times 5 \times 19 \]12160 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 30600 |
| Euler totient φ(n) | 4608 |
| Square | 147865600 |
| Cube | 1798045696000 |
| Square root | 110.272390 (= 8√190) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 112 |
| Scientific notation | 1.216 × |
12160 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and sixty |
| Binary (base 2) | 10111110000000 |
| Octal (base 8) | 27600 |
| Hexadecimal (base 16) | 2F80 |
| Base 3 | 121200101 |
| As time | 12160 seconds = 3 h 22 min 40 s |
Is 12160 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12160 ÷ 2 = 6080) | 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 (12160 ÷ 4 = 3040) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12160 ÷ 5 = 2432) | 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 1) | 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 (12160 ÷ 8 = 1520) | 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 (12160 ÷ 10 = 1216) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12160 a prime number?
No. 12160 = × 5 × 19, so it is divisible by 2.
What are the factors of 12160?
1, 2, 4, 5, 8, 10, 16, 19, 20, 32, 38, 40, 64, 76, 80, 95, 128, 152, 160, 190, 304, 320, 380, 608, 640, 760, 1216, 1520, 2432, 3040, 6080, 12160.
What is 12160 in binary?
10111110000000 (hexadecimal 2F80, octal 27600).
What is the square root of 12160?
About 110.2724, exactly 8√190.
Is 12160 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 12160?
12160 is a Harshad number: divisible by its digit sum 10.