The number 47951
47951 is the 4942nd prime number. Its only divisors are 1 and 47951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47951: the 4942nd prime number.
- 2
47951 is prime, so its only factors are 1 and 47951. It is the 4942nd prime; the next prime is 47963 and the one before is 47947.
- 3
The divisors add up to 47952; without 47951 itself that is 1, so 47951 is deficient (1 is less than 47951). Euler's totient φ(47951) = 47950 numbers up to 47951 share no factor with it.
- 4
The digits of 47951 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 145 steps to reach 1.
47951 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 47952 |
| Euler totient φ(n) | 47950 |
| Square | 2299298401 |
| Cube | 110253657626351 |
| Square root | 218.977168 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 145 |
| Scientific notation | 4.7951 × |
47951 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and fifty-one |
| Binary (base 2) | 1011101101001111 |
| Octal (base 8) | 135517 |
| Hexadecimal (base 16) | BB4F |
| Base 3 | 2102202222 |
| As time | 47951 seconds = 13 h 19 min 11 s |
Is 47951 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 1) | 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 2) | 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 47951 a prime number?
Yes. 47951 is divisible only by 1 and itself.
What are the factors of 47951?
1, 47951.
What is 47951 in binary?
1011101101001111 (hexadecimal BB4F, octal 135517).
What is the square root of 47951?
About 218.9772.
Is 47951 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 47951?
47951 is the 4942nd prime number.