The number 2764
2764 is a composite number with 6 divisors. Its prime factorisation is × 691. Divisors (6): 1, 2, 4, 691, 1382, 2764.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
2764 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
2764 is composite. Its prime factorisation is
- 3
The divisors add up to 4844; without 2764 itself that is 2080, so 2764 is deficient (2080 is less than 2764). Euler's totient φ(2764) = 1380 numbers up to 2764 share no factor with it.
- 4
The digits of 2764 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 128 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2764 = 2^{2} \times 691 \]2764 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 4844 |
| Euler totient φ(n) | 1380 |
| Square | 7639696 |
| Cube | 21116119744 |
| Square root | 52.573758 (= 2√691) |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 128 |
| Scientific notation | 2.764 × |
2764 in other forms
| Form | Value |
|---|---|
| In words | two thousand seven hundred and sixty-four |
| Roman numerals | MMDCCLXIV |
| Binary (base 2) | 101011001100 |
| Octal (base 8) | 5314 |
| Hexadecimal (base 16) | ACC |
| Base 3 | 10210101 |
| As time | 2764 seconds = 46 min 4 s |
Is 2764 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (2764 ÷ 2 = 1382) | 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 | Yes (2764 ÷ 4 = 691) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 4) | 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 4) | 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 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2764 a prime number?
No. 2764 = × 691, so it is divisible by 2.
What are the factors of 2764?
1, 2, 4, 691, 1382, 2764.
What is 2764 in binary?
101011001100 (hexadecimal ACC, octal 5314).
What is the square root of 2764?
About 52.5738, exactly 2√691.
What is 2764 in Roman numerals?
MMDCCLXIV.
Is 2764 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 2764?
It is a composite number with 6 divisors.