The number 12606
12606 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 11 × 191. Divisors (16): 1, 2, 3, 6, 11, 22, 33, 66, 191, 382, 573, 1146, 2101, 4202, 6303, 12606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
12606 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
12606 is composite. Its prime factorisation is
- 3
The divisors add up to 27648; without 12606 itself that is 15042, so 12606 is abundant (15042 is more than 12606). Euler's totient φ(12606) = 3800 numbers up to 12606 share no factor with it.
- 4
The digits of 12606 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 156 steps to reach 1.
LaTeX source of the formulas on this page
\[ 12606 = 2 \times 3 \times 11 \times 191 \]
12606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27648 |
| Euler totient φ(n) | 3800 |
| Square | 158911236 |
| Cube | 2003235041016 |
| Square root | 112.276445 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 156 |
| Scientific notation | 1.2606 × |
12606 in other forms
| Form | Value |
|---|---|
| In words | twelve thousand six hundred and six |
| Binary (base 2) | 11000100111110 |
| Octal (base 8) | 30476 |
| Hexadecimal (base 16) | 313E |
| Base 3 | 122021220 |
| As time | 12606 seconds = 3 h 30 min 6 s |
Is 12606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (12606 ÷ 2 = 6303) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (12606 ÷ 3 = 4202) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (12606 ÷ 6 = 2101) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (12606 ÷ 11 = 1146) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 12606 a prime number?
No. 12606 = 2 × 3 × 11 × 191, so it is divisible by 2.
What are the factors of 12606?
1, 2, 3, 6, 11, 22, 33, 66, 191, 382, 573, 1146, 2101, 4202, 6303, 12606.
What is 12606 in binary?
11000100111110 (hexadecimal 313E, octal 30476).
What is the square root of 12606?
About 112.2764.
Is 12606 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 12606?
It is a composite number with 16 divisors.