The number 48311
48311 is a twin prime (48311 and 48313 are both prime) and the 4971st prime number. Its only divisors are 1 and 48311.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48311: a twin prime (48311 and 48313 are both prime); the 4971st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
48311 is prime, so its only factors are 1 and 48311. It is the 4971st prime; the next prime is 48313 and the one before is 48299.
- 3
The divisors add up to 48312; without 48311 itself that is 1, so 48311 is deficient (1 is less than 48311). Euler's totient φ(48311) = 48310 numbers up to 48311 share no factor with it.
- 4
The digits of 48311 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 83 steps to reach 1.
48311 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 48312 |
| Euler totient φ(n) | 48310 |
| Square | 2333952721 |
| Cube | 112755589904231 |
| Square root | 219.797634 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 83 |
| Scientific notation | 4.8311 × |
48311 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand three hundred and eleven |
| Binary (base 2) | 1011110010110111 |
| Octal (base 8) | 136267 |
| Hexadecimal (base 16) | BCB7 |
| Base 3 | 2110021022 |
| As time | 48311 seconds = 13 h 25 min 11 s |
Is 48311 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 10) | 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 48311 a prime number?
Yes. 48311 is divisible only by 1 and itself.
What are the factors of 48311?
1, 48311.
What is 48311 in binary?
1011110010110111 (hexadecimal BCB7, octal 136267).
What is the square root of 48311?
About 219.7976.
Is 48311 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 48311?
48311 is a twin prime (48311 and 48313 are both prime); the 4971st prime number; a happy number: repeatedly adding the squares of its digits reaches 1.