The number 6993
6993 is a composite number with 16 divisors. Its prime factorisation is × 7 × 37. Divisors (16): 1, 3, 7, 9, 21, 27, 37, 63, 111, 189, 259, 333, 777, 999, 2331, 6993.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6993: a Harshad number: divisible by its digit sum 27.
- 2
6993 is composite. Its prime factorisation is
- 3
The divisors add up to 12160; without 6993 itself that is 5167, so 6993 is deficient (5167 is less than 6993). Euler's totient φ(6993) = 3888 numbers up to 6993 share no factor with it.
- 4
The digits of 6993 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6993 = 3^{3} \times 7 \times 37 \]6993 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12160 |
| Euler totient φ(n) | 3888 |
| Square | 48902049 |
| Cube | 341972028657 |
| Square root | 83.624159 (= 3√777) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 106 |
| Scientific notation | 6.993 × |
6993 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and ninety-three |
| Binary (base 2) | 1101101010001 |
| Octal (base 8) | 15521 |
| Hexadecimal (base 16) | 1B51 |
| Base 3 | 100121000 |
| As time | 6993 seconds = 1 h 56 min 33 s |
Is 6993 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 (6993 ÷ 3 = 2331) | 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 (6993 ÷ 7 = 999) | 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 | Yes (6993 ÷ 9 = 777) | 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 8) | 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 6993 a prime number?
No. 6993 = × 7 × 37, so it is divisible by 3.
What are the factors of 6993?
1, 3, 7, 9, 21, 27, 37, 63, 111, 189, 259, 333, 777, 999, 2331, 6993.
What is 6993 in binary?
1101101010001 (hexadecimal 1B51, octal 15521).
What is the square root of 6993?
About 83.6242, exactly 3√777.
Is 6993 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 6993?
6993 is a Harshad number: divisible by its digit sum 27.