The number 49771
49771 is a composite number with 4 divisors. Its prime factorisation is 71 × 701. Divisors (4): 1, 71, 701, 49771.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 49771: a semiprime: 71 × 701, the product of two primes.
- 2
49771 is composite. Its prime factorisation is
- 3
The divisors add up to 50544; without 49771 itself that is 773, so 49771 is deficient (773 is less than 49771). Euler's totient φ(49771) = 49000 numbers up to 49771 share no factor with it.
- 4
The digits of 49771 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 49771 = 71 \times 701 \]
49771 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 50544 |
| Euler totient φ(n) | 49000 |
| Square | 2477152441 |
| Cube | 123290354141011 |
| Square root | 223.094151 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 158 |
| Scientific notation | 4.9771 × |
49771 in other forms
| Form | Value |
|---|---|
| In words | forty-nine thousand seven hundred and seventy-one |
| Binary (base 2) | 1100001001101011 |
| Octal (base 8) | 141153 |
| Hexadecimal (base 16) | C26B |
| Base 3 | 2112021101 |
| As time | 49771 seconds = 13 h 49 min 31 s |
Is 49771 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 1) | 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 7) | 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 49771 a prime number?
No. 49771 = 71 × 701, so it is divisible by 71.
What are the factors of 49771?
1, 71, 701, 49771.
What is 49771 in binary?
1100001001101011 (hexadecimal C26B, octal 141153).
What is the square root of 49771?
About 223.0942.
Is 49771 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 49771?
49771 is a semiprime: 71 × 701, the product of two primes.