The number 8951
8951 is the 1113th prime number. Its only divisors are 1 and 8951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 8951: the 1113th prime number.
- 2
8951 is prime, so its only factors are 1 and 8951. It is the 1113th prime; the next prime is 8963 and the one before is 8941.
- 3
The divisors add up to 8952; without 8951 itself that is 1, so 8951 is deficient (1 is less than 8951). Euler's totient φ(8951) = 8950 numbers up to 8951 share no factor with it.
- 4
The digits of 8951 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 140 steps to reach 1.
8951 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 8952 |
| Euler totient φ(n) | 8950 |
| Square | 80120401 |
| Cube | 717157709351 |
| Square root | 94.609725 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 140 |
| Scientific notation | 8.951 × |
8951 in other forms
| Form | Value |
|---|---|
| In words | eight thousand nine hundred and fifty-one |
| Binary (base 2) | 10001011110111 |
| Octal (base 8) | 21367 |
| Hexadecimal (base 16) | 22F7 |
| Base 3 | 110021112 |
| As time | 8951 seconds = 2 h 29 min 11 s |
Is 8951 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 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 5) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 8951 a prime number?
Yes. 8951 is divisible only by 1 and itself.
What are the factors of 8951?
1, 8951.
What is 8951 in binary?
10001011110111 (hexadecimal 22F7, octal 21367).
What is the square root of 8951?
About 94.6097.
Is 8951 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 8951?
8951 is the 1113th prime number.