The number 49261
49261 is the 5063rd prime number. Its only divisors are 1 and 49261.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49261: the 5063rd prime number.
- 2
49261 is prime, so its only factors are 1 and 49261. It is the 5063rd prime; the next prime is 49277 and the one before is 49253.
- 3
The divisors add up to 49262; without 49261 itself that is 1, so 49261 is deficient (1 is less than 49261). Euler's totient φ(49261) = 49260 numbers up to 49261 share no factor with it.
- 4
The digits of 49261 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
49261 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 49262 |
| Euler totient φ(n) | 49260 |
| Square | 2426646121 |
| Cube | 119539014566581 |
| Square root | 221.948192 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9261 × |
49261 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand two hundred and sixty-one |
| Binary (base 2) | 1100000001101101 |
| Octal (base 8) | 140155 |
| Hexadecimal (base 16) | C06D |
| Base 3 | 2111120111 |
| As time | 49261 seconds = 13 h 41 min 1 s |
Is 49261 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 1) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49261 a prime number?
Yes. 49261 is divisible only by 1 and itself.
What are the factors of 49261?
1, 49261.
What is 49261 in binary?
1100000001101101 (hexadecimal C06D, octal 140155).
What is the square root of 49261?
About 221.9482.
Is 49261 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 49261?
49261 is the 5063rd prime number.