The number 49051
49051 is a composite number with 4 divisors. Its prime factorisation is 181 × 271. Divisors (4): 1, 181, 271, 49051.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49051: a semiprime: 181 × 271, the product of two primes.
- 2
49051 is composite. Its prime factorisation is
- 3
The divisors add up to 49504; without 49051 itself that is 453, so 49051 is deficient (453 is less than 49051). Euler's totient φ(49051) = 48600 numbers up to 49051 share no factor with it.
- 4
The digits of 49051 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 96 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49051 = 181 \times 271 \]
49051 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 49504 |
| Euler totient φ(n) | 48600 |
| Square | 2406000601 |
| Cube | 118016735479651 |
| Square root | 221.474604 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 96 |
| Scientific notation | 4.9051 × |
49051 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand and fifty-one |
| Binary (base 2) | 1011111110011011 |
| Octal (base 8) | 137633 |
| Hexadecimal (base 16) | BF9B |
| Base 3 | 2111021201 |
| As time | 49051 seconds = 13 h 37 min 31 s |
Is 49051 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 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 49051 a prime number?
No. 49051 = 181 × 271, so it is divisible by 181.
What are the factors of 49051?
1, 181, 271, 49051.
What is 49051 in binary?
1011111110011011 (hexadecimal BF9B, octal 137633).
What is the square root of 49051?
About 221.4746.
Is 49051 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 49051?
49051 is a semiprime: 181 × 271, the product of two primes.