The number 6938
6938 is a composite number with 4 divisors. Its prime factorisation is 2 × 3469. Divisors (4): 1, 2, 3469, 6938.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6938: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 3469, the product of two primes.
- 2
6938 is composite. Its prime factorisation is
- 3
The divisors add up to 10410; without 6938 itself that is 3472, so 6938 is deficient (3472 is less than 6938). Euler's totient φ(6938) = 3468 numbers up to 6938 share no factor with it.
- 4
The digits of 6938 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6938 = 2 \times 3469 \]
6938 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 10410 |
| Euler totient φ(n) | 3468 |
| Square | 48135844 |
| Cube | 333966485672 |
| Square root | 83.294658 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 31 |
| Scientific notation | 6.938 × |
6938 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and thirty-eight |
| Binary (base 2) | 1101100011010 |
| Octal (base 8) | 15432 |
| Hexadecimal (base 16) | 1B1A |
| Base 3 | 100111222 |
| As time | 6938 seconds = 1 h 55 min 38 s |
Is 6938 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6938 ÷ 2 = 3469) | 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 2) | 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 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6938 a prime number?
No. 6938 = 2 × 3469, so it is divisible by 2.
What are the factors of 6938?
1, 2, 3469, 6938.
What is 6938 in binary?
1101100011010 (hexadecimal 1B1A, octal 15432).
What is the square root of 6938?
About 83.2947.
Is 6938 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 6938?
6938 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 3469, the product of two primes.