The number 11291
11291 is a composite number with 4 divisors. Its prime factorisation is 7 × 1613. Divisors (4): 1, 7, 1613, 11291.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11291: a semiprime: 7 × 1613, the product of two primes.
- 2
11291 is composite. Its prime factorisation is
- 3
The divisors add up to 12912; without 11291 itself that is 1621, so 11291 is deficient (1621 is less than 11291). Euler's totient φ(11291) = 9672 numbers up to 11291 share no factor with it.
- 4
The digits of 11291 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 148 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11291 = 7 \times 1613 \]
11291 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12912 |
| Euler totient φ(n) | 9672 |
| Square | 127486681 |
| Cube | 1439452115171 |
| Square root | 106.259117 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 148 |
| Scientific notation | 1.1291 × |
11291 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and ninety-one |
| Binary (base 2) | 10110000011011 |
| Octal (base 8) | 26033 |
| Hexadecimal (base 16) | 2C1B |
| Base 3 | 120111012 |
| As time | 11291 seconds = 3 h 8 min 11 s |
Is 11291 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 | Yes (11291 ÷ 7 = 1613) | 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 5) | 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 11291 a prime number?
No. 11291 = 7 × 1613, so it is divisible by 7.
What are the factors of 11291?
1, 7, 1613, 11291.
What is 11291 in binary?
10110000011011 (hexadecimal 2C1B, octal 26033).
What is the square root of 11291?
About 106.2591.
Is 11291 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11291?
11291 is a semiprime: 7 × 1613, the product of two primes.