The number 701
701 is the 126th prime number. Its only divisors are 1 and 701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 701: the 126th prime number.
- 2
701 is prime, so its only factors are 1 and 701. It is the 126th prime; the next prime is 709 and the one before is 691.
- 3
The divisors add up to 702; without 701 itself that is 1, so 701 is deficient (1 is less than 701). Euler's totient φ(701) = 700 numbers up to 701 share no factor with it.
- 4
The digits of 701 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 82 steps to reach 1.
701 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 702 |
| Euler totient φ(n) | 700 |
| Square | 491401 |
| Cube | 344472101 |
| Square root | 26.476405 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 82 |
| Scientific notation | 7.01 × |
701 in other forms
| Form | Value |
|---|---|
| In words | seven hundred and one |
| Roman numerals | DCCI |
| Binary (base 2) | 1010111101 |
| Octal (base 8) | 1275 |
| Hexadecimal (base 16) | 2BD |
| Base 3 | 221222 |
| As time | 701 seconds = 11 min 41 s |
Is 701 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 1) | 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 8) | 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 701 a prime number?
Yes. 701 is divisible only by 1 and itself.
What are the factors of 701?
1, 701.
What is 701 in binary?
1010111101 (hexadecimal 2BD, octal 1275).
What is the square root of 701?
About 26.4764.
What is 701 in Roman numerals?
DCCI.
Is 701 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 701?
701 is the 126th prime number.