The number 91151
91151 is a twin prime (91151 and 91153 are both prime) and the 8815th prime number. Its only divisors are 1 and 91151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 91151: a twin prime (91151 and 91153 are both prime); the 8815th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
91151 is prime, so its only factors are 1 and 91151. It is the 8815th prime; the next prime is 91153 and the one before is 91141.
- 3
The divisors add up to 91152; without 91151 itself that is 1, so 91151 is deficient (1 is less than 91151). Euler's totient φ(91151) = 91150 numbers up to 91151 share no factor with it.
- 4
The digits of 91151 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 169 steps to reach 1.
91151 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 91152 |
| Euler totient φ(n) | 91150 |
| Square | 8308504801 |
| Cube | 757328521115951 |
| Square root | 301.912239 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 169 |
| Scientific notation | 9.1151 × |
91151 in other forms
| Form | Value |
|---|---|
| In words | ninety-one thousand one hundred and fifty-one |
| Binary (base 2) | 10110010000001111 |
| Octal (base 8) | 262017 |
| Hexadecimal (base 16) | 1640F |
| Base 3 | 11122000222 |
| As time | 91151 seconds = 25 h 19 min 11 s |
Is 91151 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 | 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 8) | 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 91151 a prime number?
Yes. 91151 is divisible only by 1 and itself.
What are the factors of 91151?
1, 91151.
What is 91151 in binary?
10110010000001111 (hexadecimal 1640F, octal 262017).
What is the square root of 91151?
About 301.9122.
Is 91151 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 91151?
91151 is a twin prime (91151 and 91153 are both prime); the 8815th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.