The number 9690
9690 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 17 × 19. Divisors (32): 1, 2, 3, 5, 6, 10, 15, 17, 19, 30, 34, 38, 51, 57, 85, 95 … 9690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9690 is composite. Its prime factorisation is
- 3
The divisors add up to 25920; without 9690 itself that is 16230, so 9690 is abundant (16230 is more than 9690). Euler's totient φ(9690) = 2304 numbers up to 9690 share no factor with it.
- 4
The digits of 9690 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9690 = 2 \times 3 \times 5 \times 17 \times 19 \]
9690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 25920 |
| Euler totient φ(n) | 2304 |
| Square | 93896100 |
| Cube | 909853209000 |
| Square root | 98.437798 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 73 |
| Scientific notation | 9.69 × |
9690 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and ninety |
| Binary (base 2) | 10010111011010 |
| Octal (base 8) | 22732 |
| Hexadecimal (base 16) | 25DA |
| Base 3 | 111021220 |
| As time | 9690 seconds = 2 h 41 min 30 s |
Is 9690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9690 ÷ 2 = 4845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9690 ÷ 3 = 3230) | 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 (9690 ÷ 5 = 1938) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (9690 ÷ 6 = 1615) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (9690 ÷ 10 = 969) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9690 a prime number?
No. 9690 = 2 × 3 × 5 × 17 × 19, so it is divisible by 2.
What are the factors of 9690?
1, 2, 3, 5, 6, 10, 15, 17, 19, 30, 34, 38, 51, 57, 85, 95, 102, 114, 170, 190, 255, 285, 323, 510, 570, 646, 969, 1615, 1938, 3230, 4845, 9690.
What is 9690 in binary?
10010111011010 (hexadecimal 25DA, octal 22732).
What is the square root of 9690?
About 98.4378.
Is 9690 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 9690?
It is a composite number with 32 divisors.