The number 11605
11605 is a composite number with 8 divisors. Its prime factorisation is 5 × 11 × 211. Divisors (8): 1, 5, 11, 55, 211, 1055, 2321, 11605.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11605 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11605 is composite. Its prime factorisation is
- 3
The divisors add up to 15264; without 11605 itself that is 3659, so 11605 is deficient (3659 is less than 11605). Euler's totient φ(11605) = 8400 numbers up to 11605 share no factor with it.
- 4
The digits of 11605 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 24 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11605 = 5 \times 11 \times 211 \]
11605 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 15264 |
| Euler totient φ(n) | 8400 |
| Square | 134676025 |
| Cube | 1562915270125 |
| Square root | 107.726506 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 24 |
| Scientific notation | 1.1605 × |
11605 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and five |
| Binary (base 2) | 10110101010101 |
| Octal (base 8) | 26525 |
| Hexadecimal (base 16) | 2D55 |
| Base 3 | 120220211 |
| As time | 11605 seconds = 3 h 13 min 25 s |
Is 11605 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 | No (remainder 1) | 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 (11605 ÷ 5 = 2321) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (11605 ÷ 11 = 1055) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11605 a prime number?
No. 11605 = 5 × 11 × 211, so it is divisible by 5.
What are the factors of 11605?
1, 5, 11, 55, 211, 1055, 2321, 11605.
What is 11605 in binary?
10110101010101 (hexadecimal 2D55, octal 26525).
What is the square root of 11605?
About 107.7265.
Is 11605 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11605?
It is a composite number with 8 divisors.