The number 9391
9391 is the 1161st prime number. Its only divisors are 1 and 9391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9391: the 1161st prime number.
- 2
9391 is prime, so its only factors are 1 and 9391. It is the 1161st prime; the next prime is 9397 and the one before is 9377.
- 3
The divisors add up to 9392; without 9391 itself that is 1, so 9391 is deficient (1 is less than 9391). Euler's totient φ(9391) = 9390 numbers up to 9391 share no factor with it.
- 4
The digits of 9391 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 60 steps to reach 1.
9391 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 9392 |
| Euler totient φ(n) | 9390 |
| Square | 88190881 |
| Cube | 828200563471 |
| Square root | 96.907172 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 60 |
| Scientific notation | 9.391 × |
9391 in other forms
| Form | Value |
|---|---|
| In words | nine thousand three hundred and ninety-one |
| Binary (base 2) | 10010010101111 |
| Octal (base 8) | 22257 |
| Hexadecimal (base 16) | 24AF |
| Base 3 | 110212211 |
| As time | 9391 seconds = 2 h 36 min 31 s |
Is 9391 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 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 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 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 9391 a prime number?
Yes. 9391 is divisible only by 1 and itself.
What are the factors of 9391?
1, 9391.
What is 9391 in binary?
10010010101111 (hexadecimal 24AF, octal 22257).
What is the square root of 9391?
About 96.9072.
Is 9391 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 9391?
9391 is the 1161st prime number.