The number 12170
12170 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1217. Divisors (8): 1, 2, 5, 10, 1217, 2434, 6085, 12170.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12170 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12170 is composite. Its prime factorisation is
- 3
The divisors add up to 21924; without 12170 itself that is 9754, so 12170 is deficient (9754 is less than 12170). Euler's totient φ(12170) = 4864 numbers up to 12170 share no factor with it.
- 4
The digits of 12170 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 112 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12170 = 2 \times 5 \times 1217 \]
12170 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 21924 |
| Euler totient φ(n) | 4864 |
| Square | 148108900 |
| Cube | 1802485313000 |
| Square root | 110.317723 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 112 |
| Scientific notation | 1.217 × |
12170 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand one hundred and seventy |
| Binary (base 2) | 10111110001010 |
| Octal (base 8) | 27612 |
| Hexadecimal (base 16) | 2F8A |
| Base 3 | 121200202 |
| As time | 12170 seconds = 3 h 22 min 50 s |
Is 12170 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12170 ÷ 2 = 6085) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12170 ÷ 5 = 2434) | 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 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 2) | 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 (12170 ÷ 10 = 1217) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12170 a prime number?
No. 12170 = 2 × 5 × 1217, so it is divisible by 2.
What are the factors of 12170?
1, 2, 5, 10, 1217, 2434, 6085, 12170.
What is 12170 in binary?
10111110001010 (hexadecimal 2F8A, octal 27612).
What is the square root of 12170?
About 110.3177.
Is 12170 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 12170?
It is a composite number with 8 divisors.