The number 6982
6982 is a composite number with 4 divisors. Its prime factorisation is 2 × 3491. Divisors (4): 1, 2, 3491, 6982.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6982: a semiprime: 2 × 3491, the product of two primes.
- 2
6982 is composite. Its prime factorisation is
- 3
The divisors add up to 10476; without 6982 itself that is 3494, so 6982 is deficient (3494 is less than 6982). Euler's totient φ(6982) = 3490 numbers up to 6982 share no factor with it.
- 4
The digits of 6982 add up to 25, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 150 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6982 = 2 \times 3491 \]
6982 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10476 |
| Euler totient φ(n) | 3490 |
| Square | 48748324 |
| Cube | 340360798168 |
| Square root | 83.558363 |
| Digit sum / digital root | 25 / 7 |
| Collatz steps to 1 | 150 |
| Scientific notation | 6.982 × |
6982 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and eighty-two |
| Binary (base 2) | 1101101000110 |
| Octal (base 8) | 15506 |
| Hexadecimal (base 16) | 1B46 |
| Base 3 | 100120121 |
| As time | 6982 seconds = 1 h 56 min 22 s |
Is 6982 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6982 ÷ 2 = 3491) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 3) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6982 a prime number?
No. 6982 = 2 × 3491, so it is divisible by 2.
What are the factors of 6982?
1, 2, 3491, 6982.
What is 6982 in binary?
1101101000110 (hexadecimal 1B46, octal 15506).
What is the square root of 6982?
About 83.5584.
Is 6982 divisible by 3?
No. Its digits add up to 25, which is not a multiple of 3.
What is special about the number 6982?
6982 is a semiprime: 2 × 3491, the product of two primes.