The number 6939
6939 is a binary palindrome (1101100011011). Its prime factorisation is × 257. Divisors (8): 1, 3, 9, 27, 257, 771, 2313, 6939.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6939: a binary palindrome (1101100011011); a Harshad number: divisible by its digit sum 27.
- 2
6939 is composite. Its prime factorisation is
- 3
The divisors add up to 10320; without 6939 itself that is 3381, so 6939 is deficient (3381 is less than 6939). Euler's totient φ(6939) = 4608 numbers up to 6939 share no factor with it.
- 4
The digits of 6939 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 88 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6939 = 3^{3} \times 257 \]6939 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 10320 |
| Euler totient φ(n) | 4608 |
| Square | 48149721 |
| Cube | 334110914019 |
| Square root | 83.300660 (= 3√771) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 88 |
| Scientific notation | 6.939 × |
6939 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and thirty-nine |
| Binary (base 2) | 1101100011011 |
| Octal (base 8) | 15433 |
| Hexadecimal (base 16) | 1B1B |
| Base 3 | 100112000 |
| As time | 6939 seconds = 1 h 55 min 39 s |
Is 6939 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 (6939 ÷ 3 = 2313) | 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 4) | 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 | No (remainder 2) | 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 | Yes (6939 ÷ 9 = 771) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6939 a prime number?
No. 6939 = × 257, so it is divisible by 3.
What are the factors of 6939?
1, 3, 9, 27, 257, 771, 2313, 6939.
What is 6939 in binary?
1101100011011 (hexadecimal 1B1B, octal 15433).
What is the square root of 6939?
About 83.3007, exactly 3√771.
Is 6939 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 6939?
6939 is a binary palindrome (1101100011011); a Harshad number: divisible by its digit sum 27.