The number 6958
6958 is a composite number with 12 divisors. Its prime factorisation is 2 × × 71. Divisors (12): 1, 2, 7, 14, 49, 71, 98, 142, 497, 994, 3479, 6958.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6958 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6958 is composite. Its prime factorisation is
- 3
The divisors add up to 12312; without 6958 itself that is 5354, so 6958 is deficient (5354 is less than 6958). Euler's totient φ(6958) = 2940 numbers up to 6958 share no factor with it.
- 4
The digits of 6958 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6958 = 2 \times 7^{2} \times 71 \]6958 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 12312 |
| Euler totient φ(n) | 2940 |
| Square | 48413764 |
| Cube | 336862969912 |
| Square root | 83.414627 (= 7√142) |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.958 × |
6958 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-eight |
| Binary (base 2) | 1101100101110 |
| Octal (base 8) | 15456 |
| Hexadecimal (base 16) | 1B2E |
| Base 3 | 100112201 |
| As time | 6958 seconds = 1 h 55 min 58 s |
Is 6958 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6958 ÷ 2 = 3479) | 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 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (6958 ÷ 7 = 994) | 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 1) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6958 a prime number?
No. 6958 = 2 × × 71, so it is divisible by 2.
What are the factors of 6958?
1, 2, 7, 14, 49, 71, 98, 142, 497, 994, 3479, 6958.
What is 6958 in binary?
1101100101110 (hexadecimal 1B2E, octal 15456).
What is the square root of 6958?
About 83.4146, exactly 7√142.
Is 6958 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 6958?
It is a composite number with 12 divisors.