The number 6956
6956 is a composite number with 12 divisors. Its prime factorisation is × 37 × 47. Divisors (12): 1, 2, 4, 37, 47, 74, 94, 148, 188, 1739, 3478, 6956.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6956 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6956 is composite. Its prime factorisation is
- 3
The divisors add up to 12768; without 6956 itself that is 5812, so 6956 is deficient (5812 is less than 6956). Euler's totient φ(6956) = 3312 numbers up to 6956 share no factor with it.
- 4
The digits of 6956 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6956 = 2^{2} \times 37 \times 47 \]6956 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 12768 |
| Euler totient φ(n) | 3312 |
| Square | 48385936 |
| Cube | 336572570816 |
| Square root | 83.402638 (= 2√1739) |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.956 × |
6956 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-six |
| Binary (base 2) | 1101100101100 |
| Octal (base 8) | 15454 |
| Hexadecimal (base 16) | 1B2C |
| Base 3 | 100112122 |
| As time | 6956 seconds = 1 h 55 min 56 s |
Is 6956 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6956 ÷ 2 = 3478) | 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 | Yes (6956 ÷ 4 = 1739) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 1) | 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 5) | 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 4) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6956 a prime number?
No. 6956 = × 37 × 47, so it is divisible by 2.
What are the factors of 6956?
1, 2, 4, 37, 47, 74, 94, 148, 188, 1739, 3478, 6956.
What is 6956 in binary?
1101100101100 (hexadecimal 1B2C, octal 15454).
What is the square root of 6956?
About 83.4026, exactly 2√1739.
Is 6956 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 6956?
It is a composite number with 12 divisors.