The number 10705
10705 is a composite number with 4 divisors. Its prime factorisation is 5 × 2141. Divisors (4): 1, 5, 2141, 10705.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 10705: a semiprime: 5 × 2141, the product of two primes.
- 2
10705 is composite. Its prime factorisation is
- 3
The divisors add up to 12852; without 10705 itself that is 2147, so 10705 is deficient (2147 is less than 10705). Euler's totient φ(10705) = 8560 numbers up to 10705 share no factor with it.
- 4
The digits of 10705 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 47 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10705 = 5 \times 2141 \]
10705 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12852 |
| Euler totient φ(n) | 8560 |
| Square | 114597025 |
| Cube | 1226761152625 |
| Square root | 103.464970 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 47 |
| Scientific notation | 1.0705 × |
10705 in other forms
| Form | Value |
|---|---|
| In words | ten thousand seven hundred and five |
| Binary (base 2) | 10100111010001 |
| Octal (base 8) | 24721 |
| Hexadecimal (base 16) | 29D1 |
| Base 3 | 112200111 |
| As time | 10705 seconds = 2 h 58 min 25 s |
Is 10705 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 | Yes (10705 ÷ 5 = 2141) | 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 1) | 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 5) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | 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 10705 a prime number?
No. 10705 = 5 × 2141, so it is divisible by 5.
What are the factors of 10705?
1, 5, 2141, 10705.
What is 10705 in binary?
10100111010001 (hexadecimal 29D1, octal 24721).
What is the square root of 10705?
About 103.4650.
Is 10705 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 10705?
10705 is a semiprime: 5 × 2141, the product of two primes.