The number 11690
11690 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 7 × 167. Divisors (16): 1, 2, 5, 7, 10, 14, 35, 70, 167, 334, 835, 1169, 1670, 2338, 5845, 11690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11690 is composite. Its prime factorisation is
- 3
The divisors add up to 24192; without 11690 itself that is 12502, so 11690 is abundant (12502 is more than 11690). Euler's totient φ(11690) = 3984 numbers up to 11690 share no factor with it.
- 4
The digits of 11690 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 99 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11690 = 2 \times 5 \times 7 \times 167 \]
11690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 24192 |
| Euler totient φ(n) | 3984 |
| Square | 136656100 |
| Cube | 1597509809000 |
| Square root | 108.120303 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 99 |
| Scientific notation | 1.169 × |
11690 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and ninety |
| Binary (base 2) | 10110110101010 |
| Octal (base 8) | 26652 |
| Hexadecimal (base 16) | 2DAA |
| Base 3 | 121000222 |
| As time | 11690 seconds = 3 h 14 min 50 s |
Is 11690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11690 ÷ 2 = 5845) | 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 | Yes (11690 ÷ 5 = 2338) | 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 | Yes (11690 ÷ 7 = 1670) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11690 ÷ 10 = 1169) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 11690 a prime number?
No. 11690 = 2 × 5 × 7 × 167, so it is divisible by 2.
What are the factors of 11690?
1, 2, 5, 7, 10, 14, 35, 70, 167, 334, 835, 1169, 1670, 2338, 5845, 11690.
What is 11690 in binary?
10110110101010 (hexadecimal 2DAA, octal 26652).
What is the square root of 11690?
About 108.1203.
Is 11690 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11690?
It is a composite number with 16 divisors.