The number 11391
11391 is a composite number with 4 divisors. Its prime factorisation is 3 × 3797. Divisors (4): 1, 3, 3797, 11391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11391: a semiprime: 3 × 3797, the product of two primes.
- 2
11391 is composite. Its prime factorisation is
- 3
The divisors add up to 15192; without 11391 itself that is 3801, so 11391 is deficient (3801 is less than 11391). Euler's totient φ(11391) = 7592 numbers up to 11391 share no factor with it.
- 4
The digits of 11391 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 205 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11391 = 3 \times 3797 \]
11391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 15192 |
| Euler totient φ(n) | 7592 |
| Square | 129754881 |
| Cube | 1478037849471 |
| Square root | 106.728628 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 205 |
| Scientific notation | 1.1391 × |
11391 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and ninety-one |
| Binary (base 2) | 10110001111111 |
| Octal (base 8) | 26177 |
| Hexadecimal (base 16) | 2C7F |
| Base 3 | 120121220 |
| As time | 11391 seconds = 3 h 9 min 51 s |
Is 11391 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 | Yes (11391 ÷ 3 = 3797) | 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 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11391 a prime number?
No. 11391 = 3 × 3797, so it is divisible by 3.
What are the factors of 11391?
1, 3, 3797, 11391.
What is 11391 in binary?
10110001111111 (hexadecimal 2C7F, octal 26177).
What is the square root of 11391?
About 106.7286.
Is 11391 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11391?
11391 is a semiprime: 3 × 3797, the product of two primes.