The number 6902
6902 is a composite number with 16 divisors. Its prime factorisation is 2 × 7 × 17 × 29. Divisors (16): 1, 2, 7, 14, 17, 29, 34, 58, 119, 203, 238, 406, 493, 986, 3451, 6902.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6902: a Harshad number: divisible by its digit sum 17.
- 2
6902 is composite. Its prime factorisation is
- 3
The divisors add up to 12960; without 6902 itself that is 6058, so 6902 is deficient (6058 is less than 6902). Euler's totient φ(6902) = 2688 numbers up to 6902 share no factor with it.
- 4
The digits of 6902 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6902 = 2 \times 7 \times 17 \times 29 \]
6902 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 12960 |
| Euler totient φ(n) | 2688 |
| Square | 47637604 |
| Cube | 328794742808 |
| Square root | 83.078276 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.902 × |
6902 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and two |
| Binary (base 2) | 1101011110110 |
| Octal (base 8) | 15366 |
| Hexadecimal (base 16) | 1AF6 |
| Base 3 | 100110122 |
| As time | 6902 seconds = 1 h 55 min 2 s |
Is 6902 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6902 ÷ 2 = 3451) | 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 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (6902 ÷ 7 = 986) | 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 8) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6902 a prime number?
No. 6902 = 2 × 7 × 17 × 29, so it is divisible by 2.
What are the factors of 6902?
1, 2, 7, 14, 17, 29, 34, 58, 119, 203, 238, 406, 493, 986, 3451, 6902.
What is 6902 in binary?
1101011110110 (hexadecimal 1AF6, octal 15366).
What is the square root of 6902?
About 83.0783.
Is 6902 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 6902?
6902 is a Harshad number: divisible by its digit sum 17.