The number 11701
11701 is a twin prime (11699 and 11701 are both prime) and the 1405th prime number. Its only divisors are 1 and 11701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11701: a twin prime (11699 and 11701 are both prime); the 1405th prime number.
- 2
11701 is prime, so its only factors are 1 and 11701. It is the 1405th prime; the next prime is 11717 and the one before is 11699.
- 3
The divisors add up to 11702; without 11701 itself that is 1, so 11701 is deficient (1 is less than 11701). Euler's totient φ(11701) = 11700 numbers up to 11701 share no factor with it.
- 4
The digits of 11701 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
11701 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 11702 |
| Euler totient φ(n) | 11700 |
| Square | 136913401 |
| Cube | 1602023705101 |
| Square root | 108.171161 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1701 × |
11701 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand seven hundred and one |
| Binary (base 2) | 10110110110101 |
| Octal (base 8) | 26665 |
| Hexadecimal (base 16) | 2DB5 |
| Base 3 | 121001101 |
| As time | 11701 seconds = 3 h 15 min 1 s |
Is 11701 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 | No (remainder 1) | 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 4) | 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 1) | 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 8) | 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 11701 a prime number?
Yes. 11701 is divisible only by 1 and itself.
What are the factors of 11701?
1, 11701.
What is 11701 in binary?
10110110110101 (hexadecimal 2DB5, octal 26665).
What is the square root of 11701?
About 108.1712.
Is 11701 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 11701?
11701 is a twin prime (11699 and 11701 are both prime); the 1405th prime number.