The number 2771
2771 is a composite number with 4 divisors. Its prime factorisation is 17 × 163. Divisors (4): 1, 17, 163, 2771.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2771: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 163, the product of two primes.
- 2
2771 is composite. Its prime factorisation is
- 3
The divisors add up to 2952; without 2771 itself that is 181, so 2771 is deficient (181 is less than 2771). Euler's totient φ(2771) = 2592 numbers up to 2771 share no factor with it.
- 4
The digits of 2771 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2771 = 17 \times 163 \]
2771 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 2952 |
| Euler totient φ(n) | 2592 |
| Square | 7678441 |
| Cube | 21276960011 |
| Square root | 52.640289 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 66 |
| Scientific notation | 2.771 × |
2771 in other forms
| Form | Value |
|---|---|
| In words | two thousand seven hundred and seventy-one |
| Roman numerals | MMDCCLXXI |
| Binary (base 2) | 101011010011 |
| Octal (base 8) | 5323 |
| Hexadecimal (base 16) | AD3 |
| Base 3 | 10210122 |
| As time | 2771 seconds = 46 min 11 s |
Is 2771 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 3) | 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 10) | 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 2771 a prime number?
No. 2771 = 17 × 163, so it is divisible by 17.
What are the factors of 2771?
1, 17, 163, 2771.
What is 2771 in binary?
101011010011 (hexadecimal AD3, octal 5323).
What is the square root of 2771?
About 52.6403.
What is 2771 in Roman numerals?
MMDCCLXXI.
Is 2771 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 2771?
2771 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17; a semiprime: 17 × 163, the product of two primes.