The number 11642
11642 is a composite number with 4 divisors. Its prime factorisation is 2 × 5821. Divisors (4): 1, 2, 5821, 11642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11642: a semiprime: 2 × 5821, the product of two primes.
- 2
11642 is composite. Its prime factorisation is
- 3
The divisors add up to 17466; without 11642 itself that is 5824, so 11642 is deficient (5824 is less than 11642). Euler's totient φ(11642) = 5820 numbers up to 11642 share no factor with it.
- 4
The digits of 11642 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11642 = 2 \times 5821 \]
11642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17466 |
| Euler totient φ(n) | 5820 |
| Square | 135536164 |
| Cube | 1577912021288 |
| Square root | 107.898100 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1642 × |
11642 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and forty-two |
| Binary (base 2) | 10110101111010 |
| Octal (base 8) | 26572 |
| Hexadecimal (base 16) | 2D7A |
| Base 3 | 120222012 |
| As time | 11642 seconds = 3 h 14 min 2 s |
Is 11642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11642 ÷ 2 = 5821) | 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 | No (remainder 2) | 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 | No (remainder 1) | 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 5) | 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 4) | 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 11642 a prime number?
No. 11642 = 2 × 5821, so it is divisible by 2.
What are the factors of 11642?
1, 2, 5821, 11642.
What is 11642 in binary?
10110101111010 (hexadecimal 2D7A, octal 26572).
What is the square root of 11642?
About 107.8981.
Is 11642 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11642?
11642 is a semiprime: 2 × 5821, the product of two primes.