The number 48953
48953 is the 5032nd prime number. Its only divisors are 1 and 48953.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 48953: the 5032nd prime number.
- 2
48953 is prime, so its only factors are 1 and 48953. It is the 5032nd prime; the next prime is 48973 and the one before is 48947.
- 3
The divisors add up to 48954; without 48953 itself that is 1, so 48953 is deficient (1 is less than 48953). Euler's totient φ(48953) = 48952 numbers up to 48953 share no factor with it.
- 4
The digits of 48953 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 158 steps to reach 1.
48953 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 48954 |
| Euler totient φ(n) | 48952 |
| Square | 2396396209 |
| Cube | 117310783619177 |
| Square root | 221.253249 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.8953 × |
48953 in other forms
| Form | Value |
|---|---|
| In words | forty-eight thousand nine hundred and fifty-three |
| Binary (base 2) | 1011111100111001 |
| Octal (base 8) | 137471 |
| Hexadecimal (base 16) | BF39 |
| Base 3 | 2111011002 |
| As time | 48953 seconds = 13 h 35 min 53 s |
Is 48953 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 1) | 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 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 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 48953 a prime number?
Yes. 48953 is divisible only by 1 and itself.
What are the factors of 48953?
1, 48953.
What is 48953 in binary?
1011111100111001 (hexadecimal BF39, octal 137471).
What is the square root of 48953?
About 221.2532.
Is 48953 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 48953?
48953 is the 5032nd prime number.