The number 11641
11641 is a composite number with 4 divisors. Its prime factorisation is 7 × 1663. Divisors (4): 1, 7, 1663, 11641.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11641: a semiprime: 7 × 1663, the product of two primes.
- 2
11641 is composite. Its prime factorisation is
- 3
The divisors add up to 13312; without 11641 itself that is 1671, so 11641 is deficient (1671 is less than 11641). Euler's totient φ(11641) = 9972 numbers up to 11641 share no factor with it.
- 4
The digits of 11641 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11641 = 7 \times 1663 \]
11641 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13312 |
| Euler totient φ(n) | 9972 |
| Square | 135512881 |
| Cube | 1577505447721 |
| Square root | 107.893466 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1641 × |
11641 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and forty-one |
| Binary (base 2) | 10110101111001 |
| Octal (base 8) | 26571 |
| Hexadecimal (base 16) | 2D79 |
| Base 3 | 120222011 |
| As time | 11641 seconds = 3 h 14 min 1 s |
Is 11641 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11641 ÷ 7 = 1663) | 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 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11641 a prime number?
No. 11641 = 7 × 1663, so it is divisible by 7.
What are the factors of 11641?
1, 7, 1663, 11641.
What is 11641 in binary?
10110101111001 (hexadecimal 2D79, octal 26571).
What is the square root of 11641?
About 107.8935.
Is 11641 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11641?
11641 is a semiprime: 7 × 1663, the product of two primes.