The number 10702
10702 is a composite number with 4 divisors. Its prime factorisation is 2 × 5351. Divisors (4): 1, 2, 5351, 10702.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10702: a semiprime: 2 × 5351, the product of two primes.
- 2
10702 is composite. Its prime factorisation is
- 3
The divisors add up to 16056; without 10702 itself that is 5354, so 10702 is deficient (5354 is less than 10702). Euler's totient φ(10702) = 5350 numbers up to 10702 share no factor with it.
- 4
The digits of 10702 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 192 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10702 = 2 \times 5351 \]
10702 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16056 |
| Euler totient φ(n) | 5350 |
| Square | 114532804 |
| Cube | 1225730068408 |
| Square root | 103.450471 |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 192 |
| Scientific notation | 1.0702 × |
10702 in other forms
| Form | Value |
|---|---|
| In words | ten thousand seven hundred and two |
| Binary (base 2) | 10100111001110 |
| Octal (base 8) | 24716 |
| Hexadecimal (base 16) | 29CE |
| Base 3 | 112200101 |
| As time | 10702 seconds = 2 h 58 min 22 s |
Is 10702 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10702 ÷ 2 = 5351) | 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 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 4) | 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 6) | 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 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 10702 a prime number?
No. 10702 = 2 × 5351, so it is divisible by 2.
What are the factors of 10702?
1, 2, 5351, 10702.
What is 10702 in binary?
10100111001110 (hexadecimal 29CE, octal 24716).
What is the square root of 10702?
About 103.4505.
Is 10702 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 10702?
10702 is a semiprime: 2 × 5351, the product of two primes.