The number 9641
9641 is a composite number with 4 divisors. Its prime factorisation is 31 × 311. Divisors (4): 1, 31, 311, 9641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9641: a semiprime: 31 × 311, the product of two primes.
- 2
9641 is composite. Its prime factorisation is
- 3
The divisors add up to 9984; without 9641 itself that is 343, so 9641 is deficient (343 is less than 9641). Euler's totient φ(9641) = 9300 numbers up to 9641 share no factor with it.
- 4
The digits of 9641 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 73 steps to reach 1.
LaTeX source of the formulas on this page
\[ 9641 = 31 \times 311 \]
9641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 9984 |
| Euler totient φ(n) | 9300 |
| Square | 92948881 |
| Cube | 896120161721 |
| Square root | 98.188594 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 73 |
| Scientific notation | 9.641 × |
9641 in other forms
| Form | Value |
|---|---|
| In words | nine thousand six hundred and forty-one |
| Binary (base 2) | 10010110101001 |
| Octal (base 8) | 22651 |
| Hexadecimal (base 16) | 25A9 |
| Base 3 | 111020002 |
| As time | 9641 seconds = 2 h 40 min 41 s |
Is 9641 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 2) | 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 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9641 a prime number?
No. 9641 = 31 × 311, so it is divisible by 31.
What are the factors of 9641?
1, 31, 311, 9641.
What is 9641 in binary?
10010110101001 (hexadecimal 25A9, octal 22651).
What is the square root of 9641?
About 98.1886.
Is 9641 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 9641?
9641 is a semiprime: 31 × 311, the product of two primes.