The number 6950
6950 is a composite number with 12 divisors. Its prime factorisation is 2 × × 139. Divisors (12): 1, 2, 5, 10, 25, 50, 139, 278, 695, 1390, 3475, 6950.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6950 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6950 is composite. Its prime factorisation is
- 3
The divisors add up to 13020; without 6950 itself that is 6070, so 6950 is deficient (6070 is less than 6950). Euler's totient φ(6950) = 2760 numbers up to 6950 share no factor with it.
- 4
The digits of 6950 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
\[ 6950 = 2 \times 5^{2} \times 139 \]6950 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 13020 |
| Euler totient φ(n) | 2760 |
| Square | 48302500 |
| Cube | 335702375000 |
| Square root | 83.366660 (= 5√278) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 106 |
| Scientific notation | 6.95 × |
6950 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty |
| Binary (base 2) | 1101100100110 |
| Octal (base 8) | 15446 |
| Hexadecimal (base 16) | 1B26 |
| Base 3 | 100112102 |
| As time | 6950 seconds = 1 h 55 min 50 s |
Is 6950 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6950 ÷ 2 = 3475) | 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 | Yes (6950 ÷ 5 = 1390) | 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 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 6) | 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 | Yes (6950 ÷ 10 = 695) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6950 a prime number?
No. 6950 = 2 × × 139, so it is divisible by 2.
What are the factors of 6950?
1, 2, 5, 10, 25, 50, 139, 278, 695, 1390, 3475, 6950.
What is 6950 in binary?
1101100100110 (hexadecimal 1B26, octal 15446).
What is the square root of 6950?
About 83.3667, exactly 5√278.
Is 6950 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 6950?
It is a composite number with 12 divisors.