The number 20701
20701 is a composite number with 4 divisors. Its prime factorisation is 127 × 163. Divisors (4): 1, 127, 163, 20701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20701: a semiprime: 127 × 163, the product of two primes.
- 2
20701 is composite. Its prime factorisation is
- 3
The divisors add up to 20992; without 20701 itself that is 291, so 20701 is deficient (291 is less than 20701). Euler's totient φ(20701) = 20412 numbers up to 20701 share no factor with it.
- 4
The digits of 20701 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 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20701 = 127 \times 163 \]
20701 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20992 |
| Euler totient φ(n) | 20412 |
| Square | 428531401 |
| Cube | 8871028532101 |
| Square root | 143.878421 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0701 × |
20701 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand seven hundred and one |
| Binary (base 2) | 101000011011101 |
| Octal (base 8) | 50335 |
| Hexadecimal (base 16) | 50DD |
| Base 3 | 1001101201 |
| As time | 20701 seconds = 5 h 45 min 1 s |
Is 20701 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 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 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 10) | 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 20701 a prime number?
No. 20701 = 127 × 163, so it is divisible by 127.
What are the factors of 20701?
1, 127, 163, 20701.
What is 20701 in binary?
101000011011101 (hexadecimal 50DD, octal 50335).
What is the square root of 20701?
About 143.8784.
Is 20701 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 20701?
20701 is a semiprime: 127 × 163, the product of two primes.