The number 5701
5701 is the 751st prime number. Its only divisors are 1 and 5701.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5701: the 751st prime number.
- 2
5701 is prime, so its only factors are 1 and 5701. It is the 751st prime; the next prime is 5711 and the one before is 5693.
- 3
The divisors add up to 5702; without 5701 itself that is 1, so 5701 is deficient (1 is less than 5701). Euler's totient φ(5701) = 5700 numbers up to 5701 share no factor with it.
- 4
The digits of 5701 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
5701 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 5702 |
| Euler totient φ(n) | 5700 |
| Square | 32501401 |
| Cube | 185290487101 |
| Square root | 75.504967 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.701 × |
5701 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and one |
| Binary (base 2) | 1011001000101 |
| Octal (base 8) | 13105 |
| Hexadecimal (base 16) | 1645 |
| Base 3 | 21211011 |
| As time | 5701 seconds = 1 h 35 min 1 s |
Is 5701 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 3) | 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 4) | 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 3) | 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 5701 a prime number?
Yes. 5701 is divisible only by 1 and itself.
What are the factors of 5701?
1, 5701.
What is 5701 in binary?
1011001000101 (hexadecimal 1645, octal 13105).
What is the square root of 5701?
About 75.5050.
Is 5701 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 5701?
5701 is the 751st prime number.