The number 30391
30391 is a twin prime (30389 and 30391 are both prime), the 3284th prime number and a binary palindrome (111011010110111). Its only divisors are 1 and 30391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30391: a twin prime (30389 and 30391 are both prime); the 3284th prime number; a binary palindrome (111011010110111); a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
30391 is prime, so its only factors are 1 and 30391. It is the 3284th prime; the next prime is 30403 and the one before is 30389.
- 3
The divisors add up to 30392; without 30391 itself that is 1, so 30391 is deficient (1 is less than 30391). Euler's totient φ(30391) = 30390 numbers up to 30391 share no factor with it.
- 4
The digits of 30391 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 134 steps to reach 1.
30391 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 30392 |
| Euler totient φ(n) | 30390 |
| Square | 923612881 |
| Cube | 28069519066471 |
| Square root | 174.330147 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 134 |
| Scientific notation | 3.0391 × |
30391 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand three hundred and ninety-one |
| Binary (base 2) | 111011010110111 |
| Octal (base 8) | 73267 |
| Hexadecimal (base 16) | 76B7 |
| Base 3 | 1112200121 |
| As time | 30391 seconds = 8 h 26 min 31 s |
Is 30391 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 7) | 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 9) | 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 30391 a prime number?
Yes. 30391 is divisible only by 1 and itself.
What are the factors of 30391?
1, 30391.
What is 30391 in binary?
111011010110111 (hexadecimal 76B7, octal 73267).
What is the square root of 30391?
About 174.3301.
Is 30391 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 30391?
30391 is a twin prime (30389 and 30391 are both prime); the 3284th prime number; a binary palindrome (111011010110111); a happy number: repeatedly adding the squares of its digits reaches 1.