The number 9701
9701 is a composite number with 4 divisors. Its prime factorisation is 89 × 109. Divisors (4): 1, 89, 109, 9701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9701: a semiprime: 89 × 109, the product of two primes.
- 2
9701 is composite. Its prime factorisation is
- 3
The divisors add up to 9900; without 9701 itself that is 199, so 9701 is deficient (199 is less than 9701). Euler's totient φ(9701) = 9504 numbers up to 9701 share no factor with it.
- 4
The digits of 9701 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9701 = 89 \times 109 \]
9701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9900 |
| Euler totient φ(n) | 9504 |
| Square | 94109401 |
| Cube | 912955299101 |
| Square root | 98.493655 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 166 |
| Scientific notation | 9.701 × |
9701 in other forms
| Form | Value |
|---|---|
| In words | nine thousand seven hundred and one |
| Binary (base 2) | 10010111100101 |
| Octal (base 8) | 22745 |
| Hexadecimal (base 16) | 25E5 |
| Base 3 | 111022022 |
| As time | 9701 seconds = 2 h 41 min 41 s |
Is 9701 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 2) | 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 5) | 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 8) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9701 a prime number?
No. 9701 = 89 × 109, so it is divisible by 89.
What are the factors of 9701?
1, 89, 109, 9701.
What is 9701 in binary?
10010111100101 (hexadecimal 25E5, octal 22745).
What is the square root of 9701?
About 98.4937.
Is 9701 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 9701?
9701 is a semiprime: 89 × 109, the product of two primes.