The number 11709
11709 is a composite number with 6 divisors. Its prime factorisation is × 1301. Divisors (6): 1, 3, 9, 1301, 3903, 11709.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11709 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11709 is composite. Its prime factorisation is
- 3
The divisors add up to 16926; without 11709 itself that is 5217, so 11709 is deficient (5217 is less than 11709). Euler's totient φ(11709) = 7800 numbers up to 11709 share no factor with it.
- 4
The digits of 11709 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 174 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11709 = 3^{2} \times 1301 \]11709 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 16926 |
| Euler totient φ(n) | 7800 |
| Square | 137100681 |
| Cube | 1605311873829 |
| Square root | 108.208133 (= 3√1301) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 174 |
| Scientific notation | 1.1709 × |
11709 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand seven hundred and nine |
| Binary (base 2) | 10110110111101 |
| Octal (base 8) | 26675 |
| Hexadecimal (base 16) | 2DBD |
| Base 3 | 121001200 |
| As time | 11709 seconds = 3 h 15 min 9 s |
Is 11709 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 (11709 ÷ 3 = 3903) | 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 4) | 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 5) | 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 | Yes (11709 ÷ 9 = 1301) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | 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 11709 a prime number?
No. 11709 = × 1301, so it is divisible by 3.
What are the factors of 11709?
1, 3, 9, 1301, 3903, 11709.
What is 11709 in binary?
10110110111101 (hexadecimal 2DBD, octal 26675).
What is the square root of 11709?
About 108.2081, exactly 3√1301.
Is 11709 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 11709?
It is a composite number with 6 divisors.