The number 9151
9151 is the 1134th prime number. Its only divisors are 1 and 9151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 9151: the 1134th prime number.
- 2
9151 is prime, so its only factors are 1 and 9151. It is the 1134th prime; the next prime is 9157 and the one before is 9137.
- 3
The divisors add up to 9152; without 9151 itself that is 1, so 9151 is deficient (1 is less than 9151). Euler's totient φ(9151) = 9150 numbers up to 9151 share no factor with it.
- 4
The digits of 9151 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 91 steps to reach 1.
9151 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 9152 |
| Euler totient φ(n) | 9150 |
| Square | 83740801 |
| Cube | 766312069951 |
| Square root | 95.660859 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 91 |
| Scientific notation | 9.151 × |
9151 in other forms
| Form | Value |
|---|---|
| In words | nine thousand one hundred and fifty-one |
| Binary (base 2) | 10001110111111 |
| Octal (base 8) | 21677 |
| Hexadecimal (base 16) | 23BF |
| Base 3 | 110112221 |
| As time | 9151 seconds = 2 h 32 min 31 s |
Is 9151 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 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 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 10) | 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 9151 a prime number?
Yes. 9151 is divisible only by 1 and itself.
What are the factors of 9151?
1, 9151.
What is 9151 in binary?
10001110111111 (hexadecimal 23BF, octal 21677).
What is the square root of 9151?
About 95.6609.
Is 9151 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 9151?
9151 is the 1134th prime number.