The number 11601
11601 is a composite number with 6 divisors. Its prime factorisation is × 1289. Divisors (6): 1, 3, 9, 1289, 3867, 11601.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11601: a Harshad number: divisible by its digit sum 9.
- 2
11601 is composite. Its prime factorisation is
- 3
The divisors add up to 16770; without 11601 itself that is 5169, so 11601 is deficient (5169 is less than 11601). Euler's totient φ(11601) = 7728 numbers up to 11601 share no factor with it.
- 4
The digits of 11601 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11601 = 3^{2} \times 1289 \]11601 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 16770 |
| Euler totient φ(n) | 7728 |
| Square | 134583201 |
| Cube | 1561299714801 |
| Square root | 107.707938 (= 3√1289) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1601 × |
11601 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and one |
| Binary (base 2) | 10110101010001 |
| Octal (base 8) | 26521 |
| Hexadecimal (base 16) | 2D51 |
| Base 3 | 120220200 |
| As time | 11601 seconds = 3 h 13 min 21 s |
Is 11601 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 (11601 ÷ 3 = 3867) | 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 | No (remainder 1) | 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 | No (remainder 2) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (11601 ÷ 9 = 1289) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 11601 a prime number?
No. 11601 = × 1289, so it is divisible by 3.
What are the factors of 11601?
1, 3, 9, 1289, 3867, 11601.
What is 11601 in binary?
10110101010001 (hexadecimal 2D51, octal 26521).
What is the square root of 11601?
About 107.7079, exactly 3√1289.
Is 11601 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 11601?
11601 is a Harshad number: divisible by its digit sum 9.