The number 6951
6951 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 331. Divisors (8): 1, 3, 7, 21, 331, 993, 2317, 6951.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6951: a Harshad number: divisible by its digit sum 21.
- 2
6951 is composite. Its prime factorisation is
- 3
The divisors add up to 10624; without 6951 itself that is 3673, so 6951 is deficient (3673 is less than 6951). Euler's totient φ(6951) = 3960 numbers up to 6951 share no factor with it.
- 4
The digits of 6951 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 111 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6951 = 3 \times 7 \times 331 \]
6951 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10624 |
| Euler totient φ(n) | 3960 |
| Square | 48316401 |
| Cube | 335847303351 |
| Square root | 83.372657 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 111 |
| Scientific notation | 6.951 × |
6951 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-one |
| Binary (base 2) | 1101100100111 |
| Octal (base 8) | 15447 |
| Hexadecimal (base 16) | 1B27 |
| Base 3 | 100112110 |
| As time | 6951 seconds = 1 h 55 min 51 s |
Is 6951 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 (6951 ÷ 3 = 2317) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (6951 ÷ 7 = 993) | 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 7) | 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 1) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6951 a prime number?
No. 6951 = 3 × 7 × 331, so it is divisible by 3.
What are the factors of 6951?
1, 3, 7, 21, 331, 993, 2317, 6951.
What is 6951 in binary?
1101100100111 (hexadecimal 1B27, octal 15447).
What is the square root of 6951?
About 83.3727.
Is 6951 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 6951?
6951 is a Harshad number: divisible by its digit sum 21.