The number 5702
5702 is a composite number with 4 divisors. Its prime factorisation is 2 × 2851. Divisors (4): 1, 2, 2851, 5702.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5702: a semiprime: 2 × 2851, the product of two primes.
- 2
5702 is composite. Its prime factorisation is
- 3
The divisors add up to 8556; without 5702 itself that is 2854, so 5702 is deficient (2854 is less than 5702). Euler's totient φ(5702) = 2850 numbers up to 5702 share no factor with it.
- 4
The digits of 5702 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 28 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5702 = 2 \times 2851 \]
5702 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 8556 |
| Euler totient φ(n) | 2850 |
| Square | 32512804 |
| Cube | 185388008408 |
| Square root | 75.511589 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 28 |
| Scientific notation | 5.702 × |
5702 in other forms
| Form | Value |
|---|---|
| In words | five thousand seven hundred and two |
| Binary (base 2) | 1011001000110 |
| Octal (base 8) | 13106 |
| Hexadecimal (base 16) | 1646 |
| Base 3 | 21211012 |
| As time | 5702 seconds = 1 h 35 min 2 s |
Is 5702 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5702 ÷ 2 = 2851) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5702 a prime number?
No. 5702 = 2 × 2851, so it is divisible by 2.
What are the factors of 5702?
1, 2, 2851, 5702.
What is 5702 in binary?
1011001000110 (hexadecimal 1646, octal 13106).
What is the square root of 5702?
About 75.5116.
Is 5702 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 5702?
5702 is a semiprime: 2 × 2851, the product of two primes.