The number 49151
49151 is a composite number with 4 divisors. Its prime factorisation is 23 × 2137. Divisors (4): 1, 23, 2137, 49151.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49151: a semiprime: 23 × 2137, the product of two primes.
- 2
49151 is composite. Its prime factorisation is
- 3
The divisors add up to 51312; without 49151 itself that is 2161, so 49151 is deficient (2161 is less than 49151). Euler's totient φ(49151) = 46992 numbers up to 49151 share no factor with it.
- 4
The digits of 49151 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 127 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49151 = 23 \times 2137 \]
49151 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 51312 |
| Euler totient φ(n) | 46992 |
| Square | 2415820801 |
| Cube | 118740008189951 |
| Square root | 221.700248 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 127 |
| Scientific notation | 4.9151 × |
49151 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand one hundred and fifty-one |
| Binary (base 2) | 1011111111111111 |
| Octal (base 8) | 137777 |
| Hexadecimal (base 16) | BFFF |
| Base 3 | 2111102102 |
| As time | 49151 seconds = 13 h 39 min 11 s |
Is 49151 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 2) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49151 a prime number?
No. 49151 = 23 × 2137, so it is divisible by 23.
What are the factors of 49151?
1, 23, 2137, 49151.
What is 49151 in binary?
1011111111111111 (hexadecimal BFFF, octal 137777).
What is the square root of 49151?
About 221.7002.
Is 49151 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 49151?
49151 is a semiprime: 23 × 2137, the product of two primes.