The number 49157
49157 is the 5052nd prime number. Its only divisors are 1 and 49157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49157: the 5052nd prime number.
- 2
49157 is prime, so its only factors are 1 and 49157. It is the 5052nd prime; the next prime is 49169 and the one before is 49139.
- 3
The divisors add up to 49158; without 49157 itself that is 1, so 49157 is deficient (1 is less than 49157). Euler's totient φ(49157) = 49156 numbers up to 49157 share no factor with it.
- 4
The digits of 49157 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 52 steps to reach 1.
49157 at a glance
| Property | Value |
|---|---|
| Type | prime |
| Number of divisors | 2 |
| Sum of divisors | 49158 |
| Euler totient φ(n) | 49156 |
| Square | 2416410649 |
| Cube | 118783498272893 |
| Square root | 221.713779 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 52 |
| Scientific notation | 4.9157 × |
49157 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty-seven |
| Binary (base 2) | 1100000000000101 |
| Octal (base 8) | 140005 |
| Hexadecimal (base 16) | C005 |
| Base 3 | 2111102122 |
| As time | 49157 seconds = 13 h 39 min 17 s |
Is 49157 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 2) | 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 3) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 49157 a prime number?
Yes. 49157 is divisible only by 1 and itself.
What are the factors of 49157?
1, 49157.
What is 49157 in binary?
1100000000000101 (hexadecimal C005, octal 140005).
What is the square root of 49157?
About 221.7138.
Is 49157 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 49157?
49157 is the 5052nd prime number.