The number 49391
49391 is a twin prime (49391 and 49393 are both prime) and the 5074th prime number. Its only divisors are 1 and 49391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49391: a twin prime (49391 and 49393 are both prime); the 5074th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
49391 is prime, so its only factors are 1 and 49391. It is the 5074th prime; the next prime is 49393 and the one before is 49369.
- 3
The divisors add up to 49392; without 49391 itself that is 1, so 49391 is deficient (1 is less than 49391). Euler's totient φ(49391) = 49390 numbers up to 49391 share no factor with it.
- 4
The digits of 49391 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 96 steps to reach 1.
49391 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 49392 |
| Euler totient φ(n) | 49390 |
| Square | 2439470881 |
| Cube | 120487906283471 |
| Square root | 222.240860 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9391 × |
49391 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand three hundred and ninety-one |
| Binary (base 2) | 1100000011101111 |
| Octal (base 8) | 140357 |
| Hexadecimal (base 16) | C0EF |
| Base 3 | 2111202022 |
| As time | 49391 seconds = 13 h 43 min 11 s |
Is 49391 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 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 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 1) | 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 49391 a prime number?
Yes. 49391 is divisible only by 1 and itself.
What are the factors of 49391?
1, 49391.
What is 49391 in binary?
1100000011101111 (hexadecimal C0EF, octal 140357).
What is the square root of 49391?
About 222.2409.
Is 49391 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49391?
49391 is a twin prime (49391 and 49393 are both prime); the 5074th prime number; a happy number: repeatedly adding the squares of its digits reaches 1.