The number 47963
47963 is the 4943rd prime number. Its only divisors are 1 and 47963.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 47963: the 4943rd prime number.
- 2
47963 is prime, so its only factors are 1 and 47963. It is the 4943rd prime; the next prime is 47969 and the one before is 47951.
- 3
The divisors add up to 47964; without 47963 itself that is 1, so 47963 is deficient (1 is less than 47963). Euler's totient φ(47963) = 47962 numbers up to 47963 share no factor with it.
- 4
The digits of 47963 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 189 steps to reach 1.
47963 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 47964 |
| Euler totient φ(n) | 47962 |
| Square | 2300449369 |
| Cube | 110336453085347 |
| Square root | 219.004566 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 189 |
| Scientific notation | 4.7963 × |
47963 in other forms
| Form | Value |
|---|---|
| In words | forty-seven thousand nine hundred and sixty-three |
| Binary (base 2) | 1011101101011011 |
| Octal (base 8) | 135533 |
| Hexadecimal (base 16) | BB5B |
| Base 3 | 2102210102 |
| As time | 47963 seconds = 13 h 19 min 23 s |
Is 47963 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 3) | 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 6) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 47963 a prime number?
Yes. 47963 is divisible only by 1 and itself.
What are the factors of 47963?
1, 47963.
What is 47963 in binary?
1011101101011011 (hexadecimal BB5B, octal 135533).
What is the square root of 47963?
About 219.0046.
Is 47963 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 47963?
47963 is the 4943rd prime number.