The number 2793
2793 is a composite number with 12 divisors. Its prime factorisation is 3 × × 19. Divisors (12): 1, 3, 7, 19, 21, 49, 57, 133, 147, 399, 931, 2793.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 2793: a Harshad number: divisible by its digit sum 21.
- 2
2793 is composite. Its prime factorisation is
- 3
The divisors add up to 4560; without 2793 itself that is 1767, so 2793 is deficient (1767 is less than 2793). Euler's totient φ(2793) = 1512 numbers up to 2793 share no factor with it.
- 4
The digits of 2793 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 110 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2793 = 3 \times 7^{2} \times 19 \]2793 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 4560 |
| Euler totient φ(n) | 1512 |
| Square | 7800849 |
| Cube | 21787771257 |
| Square root | 52.848841 (= 7√57) |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 110 |
| Scientific notation | 2.793 × |
2793 in other forms
| Form | Value |
|---|---|
| In words | two thousand seven hundred and ninety-three |
| Roman numerals | MMDCCXCIII |
| Binary (base 2) | 101011101001 |
| Octal (base 8) | 5351 |
| Hexadecimal (base 16) | AE9 |
| Base 3 | 10211110 |
| As time | 2793 seconds = 46 min 33 s |
Is 2793 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 | Yes (2793 ÷ 3 = 931) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (2793 ÷ 7 = 399) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2793 a prime number?
No. 2793 = 3 × × 19, so it is divisible by 3.
What are the factors of 2793?
1, 3, 7, 19, 21, 49, 57, 133, 147, 399, 931, 2793.
What is 2793 in binary?
101011101001 (hexadecimal AE9, octal 5351).
What is the square root of 2793?
About 52.8488, exactly 7√57.
What is 2793 in Roman numerals?
MMDCCXCIII.
Is 2793 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 2793?
2793 is a Harshad number: divisible by its digit sum 21.