The number 15391
15391 is the 1799th prime number. Its only divisors are 1 and 15391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 15391: the 1799th prime number.
- 2
15391 is prime, so its only factors are 1 and 15391. It is the 1799th prime; the next prime is 15401 and the one before is 15383.
- 3
The divisors add up to 15392; without 15391 itself that is 1, so 15391 is deficient (1 is less than 15391). Euler's totient φ(15391) = 15390 numbers up to 15391 share no factor with it.
- 4
The digits of 15391 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 177 steps to reach 1.
15391 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 15392 |
| Euler totient φ(n) | 15390 |
| Square | 236882881 |
| Cube | 3645864421471 |
| Square root | 124.060469 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 177 |
| Scientific notation | 1.5391 × |
15391 in other forms
| Form | Value |
|---|---|
| In words | fifteen thousand three hundred and ninety-one |
| Binary (base 2) | 11110000011111 |
| Octal (base 8) | 36037 |
| Hexadecimal (base 16) | 3C1F |
| Base 3 | 210010001 |
| As time | 15391 seconds = 4 h 16 min 31 s |
Is 15391 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 5) | 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 1) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 15391 a prime number?
Yes. 15391 is divisible only by 1 and itself.
What are the factors of 15391?
1, 15391.
What is 15391 in binary?
11110000011111 (hexadecimal 3C1F, octal 36037).
What is the square root of 15391?
About 124.0605.
Is 15391 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 15391?
15391 is the 1799th prime number.