The number 6851
6851 is a composite number with 8 divisors. Its prime factorisation is 13 × 17 × 31. Divisors (8): 1, 13, 17, 31, 221, 403, 527, 6851.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6851 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6851 is composite. Its prime factorisation is
- 3
The divisors add up to 8064; without 6851 itself that is 1213, so 6851 is deficient (1213 is less than 6851). Euler's totient φ(6851) = 5760 numbers up to 6851 share no factor with it.
- 4
The digits of 6851 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6851 = 13 \times 17 \times 31 \]
6851 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 8064 |
| Euler totient φ(n) | 5760 |
| Square | 46936201 |
| Cube | 321559913051 |
| Square root | 82.770768 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.851 × |
6851 in other forms
| Form | Value |
|---|---|
| In words | six thousand eight hundred and fifty-one |
| Binary (base 2) | 1101011000011 |
| Octal (base 8) | 15303 |
| Hexadecimal (base 16) | 1AC3 |
| Base 3 | 100101202 |
| As time | 6851 seconds = 1 h 54 min 11 s |
Is 6851 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 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6851 a prime number?
No. 6851 = 13 × 17 × 31, so it is divisible by 13.
What are the factors of 6851?
1, 13, 17, 31, 221, 403, 527, 6851.
What is 6851 in binary?
1101011000011 (hexadecimal 1AC3, octal 15303).
What is the square root of 6851?
About 82.7708.
Is 6851 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 6851?
It is a composite number with 8 divisors.