The number 6943
6943 is a composite number with 4 divisors. Its prime factorisation is 53 × 131. Divisors (4): 1, 53, 131, 6943.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6943: a semiprime: 53 × 131, the product of two primes.
- 2
6943 is composite. Its prime factorisation is
- 3
The divisors add up to 7128; without 6943 itself that is 185, so 6943 is deficient (185 is less than 6943). Euler's totient φ(6943) = 6760 numbers up to 6943 share no factor with it.
- 4
The digits of 6943 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 256 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6943 = 53 \times 131 \]
6943 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 7128 |
| Euler totient φ(n) | 6760 |
| Square | 48205249 |
| Cube | 334689043807 |
| Square root | 83.324666 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 256 |
| Scientific notation | 6.943 × |
6943 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and forty-three |
| Binary (base 2) | 1101100011111 |
| Octal (base 8) | 15437 |
| Hexadecimal (base 16) | 1B1F |
| Base 3 | 100112011 |
| As time | 6943 seconds = 1 h 55 min 43 s |
Is 6943 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 1) | 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 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 2) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6943 a prime number?
No. 6943 = 53 × 131, so it is divisible by 53.
What are the factors of 6943?
1, 53, 131, 6943.
What is 6943 in binary?
1101100011111 (hexadecimal 1B1F, octal 15437).
What is the square root of 6943?
About 83.3247.
Is 6943 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 6943?
6943 is a semiprime: 53 × 131, the product of two primes.