The number 10606
10606 is a composite number with 4 divisors. Its prime factorisation is 2 × 5303. Divisors (4): 1, 2, 5303, 10606.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10606: a semiprime: 2 × 5303, the product of two primes.
- 2
10606 is composite. Its prime factorisation is
- 3
The divisors add up to 15912; without 10606 itself that is 5306, so 10606 is deficient (5306 is less than 10606). Euler's totient φ(10606) = 5302 numbers up to 10606 share no factor with it.
- 4
The digits of 10606 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10606 = 2 \times 5303 \]
10606 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15912 |
| Euler totient φ(n) | 5302 |
| Square | 112487236 |
| Cube | 1193039625016 |
| Square root | 102.985436 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0606 × |
10606 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and six |
| Binary (base 2) | 10100101101110 |
| Octal (base 8) | 24556 |
| Hexadecimal (base 16) | 296E |
| Base 3 | 112112211 |
| As time | 10606 seconds = 2 h 56 min 46 s |
Is 10606 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10606 ÷ 2 = 5303) | 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 | No (remainder 1) | 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 | No (remainder 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 | No (remainder 2) | 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 10606 a prime number?
No. 10606 = 2 × 5303, so it is divisible by 2.
What are the factors of 10606?
1, 2, 5303, 10606.
What is 10606 in binary?
10100101101110 (hexadecimal 296E, octal 24556).
What is the square root of 10606?
About 102.9854.
Is 10606 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10606?
10606 is a semiprime: 2 × 5303, the product of two primes.