The number 6941
6941 is a composite number with 4 divisors. Its prime factorisation is 11 × 631. Divisors (4): 1, 11, 631, 6941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6941: a semiprime: 11 × 631, the product of two primes.
- 2
6941 is composite. Its prime factorisation is
- 3
The divisors add up to 7584; without 6941 itself that is 643, so 6941 is deficient (643 is less than 6941). Euler's totient φ(6941) = 6300 numbers up to 6941 share no factor with it.
- 4
The digits of 6941 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 106 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6941 = 11 \times 631 \]
6941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7584 |
| Euler totient φ(n) | 6300 |
| Square | 48177481 |
| Cube | 334399895621 |
| Square root | 83.312664 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 106 |
| Scientific notation | 6.941 × |
6941 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and forty-one |
| Binary (base 2) | 1101100011101 |
| Octal (base 8) | 15435 |
| Hexadecimal (base 16) | 1B1D |
| Base 3 | 100112002 |
| As time | 6941 seconds = 1 h 55 min 41 s |
Is 6941 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 1) | 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 4) | 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 5) | 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 | Yes (6941 ÷ 11 = 631) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6941 a prime number?
No. 6941 = 11 × 631, so it is divisible by 11.
What are the factors of 6941?
1, 11, 631, 6941.
What is 6941 in binary?
1101100011101 (hexadecimal 1B1D, octal 15435).
What is the square root of 6941?
About 83.3127.
Is 6941 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 6941?
6941 is a semiprime: 11 × 631, the product of two primes.