The number 10690
10690 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 1069. Divisors (8): 1, 2, 5, 10, 1069, 2138, 5345, 10690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
10690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
10690 is composite. Its prime factorisation is
- 3
The divisors add up to 19260; without 10690 itself that is 8570, so 10690 is deficient (8570 is less than 10690). Euler's totient φ(10690) = 4272 numbers up to 10690 share no factor with it.
- 4
The digits of 10690 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 161 steps to reach 1.
LaTeX source of the formulas on this page
\[ 10690 = 2 \times 5 \times 1069 \]
10690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19260 |
| Euler totient φ(n) | 4272 |
| Square | 114276100 |
| Cube | 1221611509000 |
| Square root | 103.392456 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 161 |
| Scientific notation | 1.069 × |
10690 in other forms
| Form | Value |
|---|---|
| In words | ten thousand six hundred and ninety |
| Binary (base 2) | 10100111000010 |
| Octal (base 8) | 24702 |
| Hexadecimal (base 16) | 29C2 |
| Base 3 | 112122221 |
| As time | 10690 seconds = 2 h 58 min 10 s |
Is 10690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (10690 ÷ 2 = 5345) | 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 | Yes (10690 ÷ 5 = 2138) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (10690 ÷ 10 = 1069) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 10690 a prime number?
No. 10690 = 2 × 5 × 1069, so it is divisible by 2.
What are the factors of 10690?
1, 2, 5, 10, 1069, 2138, 5345, 10690.
What is 10690 in binary?
10100111000010 (hexadecimal 29C2, octal 24702).
What is the square root of 10690?
About 103.3925.
Is 10690 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 10690?
It is a composite number with 8 divisors.