The number 9642
9642 is a composite number with 8 divisors. Its prime factorisation is 2 × 3 × 1607. Divisors (8): 1, 2, 3, 6, 1607, 3214, 4821, 9642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
9642 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
9642 is composite. Its prime factorisation is
- 3
The divisors add up to 19296; without 9642 itself that is 9654, so 9642 is abundant (9654 is more than 9642). Euler's totient φ(9642) = 3212 numbers up to 9642 share no factor with it.
- 4
The digits of 9642 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 21 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9642 = 2 \times 3 \times 1607 \]
9642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 19296 |
| Euler totient φ(n) | 3212 |
| Square | 92968164 |
| Cube | 896399037288 |
| Square root | 98.193686 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 21 |
| Scientific notation | 9.642 × |
9642 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and forty-two |
| Binary (base 2) | 10010110101010 |
| Octal (base 8) | 22652 |
| Hexadecimal (base 16) | 25AA |
| Base 3 | 111020010 |
| As time | 9642 seconds = 2 h 40 min 42 s |
Is 9642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (9642 ÷ 2 = 4821) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (9642 ÷ 3 = 3214) | 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 | Yes (9642 ÷ 6 = 1607) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 3) | 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 6) | 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 9642 a prime number?
No. 9642 = 2 × 3 × 1607, so it is divisible by 2.
What are the factors of 9642?
1, 2, 3, 6, 1607, 3214, 4821, 9642.
What is 9642 in binary?
10010110101010 (hexadecimal 25AA, octal 22652).
What is the square root of 9642?
About 98.1937.
Is 9642 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 9642?
It is a composite number with 8 divisors.