The number 11651
11651 is a composite number with 4 divisors. Its prime factorisation is 61 × 191. Divisors (4): 1, 61, 191, 11651.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11651: a semiprime: 61 × 191, the product of two primes.
- 2
11651 is composite. Its prime factorisation is
- 3
The divisors add up to 11904; without 11651 itself that is 253, so 11651 is deficient (253 is less than 11651). Euler's totient φ(11651) = 11400 numbers up to 11651 share no factor with it.
- 4
The digits of 11651 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 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11651 = 61 \times 191 \]
11651 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11904 |
| Euler totient φ(n) | 11400 |
| Square | 135745801 |
| Cube | 1581574327451 |
| Square root | 107.939798 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1651 × |
11651 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and fifty-one |
| Binary (base 2) | 10110110000011 |
| Octal (base 8) | 26603 |
| Hexadecimal (base 16) | 2D83 |
| Base 3 | 120222112 |
| As time | 11651 seconds = 3 h 14 min 11 s |
Is 11651 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 3) | 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 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11651 a prime number?
No. 11651 = 61 × 191, so it is divisible by 61.
What are the factors of 11651?
1, 61, 191, 11651.
What is 11651 in binary?
10110110000011 (hexadecimal 2D83, octal 26603).
What is the square root of 11651?
About 107.9398.
Is 11651 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11651?
11651 is a semiprime: 61 × 191, the product of two primes.