The number 10605
10605 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 7 × 101. Divisors (16): 1, 3, 5, 7, 15, 21, 35, 101, 105, 303, 505, 707, 1515, 2121, 3535, 10605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10605 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10605 is composite. Its prime factorisation is
- 3
The divisors add up to 19584; without 10605 itself that is 8979, so 10605 is deficient (8979 is less than 10605). Euler's totient φ(10605) = 4800 numbers up to 10605 share no factor with it.
- 4
The digits of 10605 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10605 = 3 \times 5 \times 7 \times 101 \]
10605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19584 |
| Euler totient φ(n) | 4800 |
| Square | 112466025 |
| Cube | 1192702195125 |
| Square root | 102.980581 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.0605 × |
10605 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and five |
| Binary (base 2) | 10100101101101 |
| Octal (base 8) | 24555 |
| Hexadecimal (base 16) | 296D |
| Base 3 | 112112210 |
| As time | 10605 seconds = 2 h 56 min 45 s |
Is 10605 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (10605 ÷ 3 = 3535) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (10605 ÷ 5 = 2121) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (10605 ÷ 7 = 1515) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10605 a prime number?
No. 10605 = 3 × 5 × 7 × 101, so it is divisible by 3.
What are the factors of 10605?
1, 3, 5, 7, 15, 21, 35, 101, 105, 303, 505, 707, 1515, 2121, 3535, 10605.
What is 10605 in binary?
10100101101101 (hexadecimal 296D, octal 24555).
What is the square root of 10605?
About 102.9806.
Is 10605 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 10605?
It is a composite number with 16 divisors.