The number 12670
12670 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 181. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 181, 362, 905, 1267, 1810, 2534, 6335, 12670.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12670 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12670 is composite. Its prime factorisation is
- 3
The divisors add up to 26208; without 12670 itself that is 13538, so 12670 is abundant (13538 is more than 12670). Euler's totient φ(12670) = 4320 numbers up to 12670 share no factor with it.
- 4
The digits of 12670 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12670 = 2 \times 5 \times 7 \times 181 \]
12670 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 26208 |
| Euler totient φ(n) | 4320 |
| Square | 160528900 |
| Cube | 2033901163000 |
| Square root | 112.561095 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.267 × |
12670 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and seventy |
| Binary (base 2) | 11000101111110 |
| Octal (base 8) | 30576 |
| Hexadecimal (base 16) | 317E |
| Base 3 | 122101021 |
| As time | 12670 seconds = 3 h 31 min 10 s |
Is 12670 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12670 ÷ 2 = 6335) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (12670 ÷ 5 = 2534) | 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 | Yes (12670 ÷ 7 = 1810) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (12670 ÷ 10 = 1267) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12670 a prime number?
No. 12670 = 2 × 5 × 7 × 181, so it is divisible by 2.
What are the factors of 12670?
1, 2, 5, 7, 10, 14, 35, 70, 181, 362, 905, 1267, 1810, 2534, 6335, 12670.
What is 12670 in binary?
11000101111110 (hexadecimal 317E, octal 30576).
What is the square root of 12670?
About 112.5611.
Is 12670 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 12670?
It is a composite number with 16 divisors.