The number 6957
6957 is a composite number with 6 divisors. Its prime factorisation is × 773. Divisors (6): 1, 3, 9, 773, 2319, 6957.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6957 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6957 is composite. Its prime factorisation is
- 3
The divisors add up to 10062; without 6957 itself that is 3105, so 6957 is deficient (3105 is less than 6957). Euler's totient φ(6957) = 4632 numbers up to 6957 share no factor with it.
- 4
The digits of 6957 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 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6957 = 3^{2} \times 773 \]6957 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 10062 |
| Euler totient φ(n) | 4632 |
| Square | 48399849 |
| Cube | 336717749493 |
| Square root | 83.408633 (= 3√773) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.957 × |
6957 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-seven |
| Binary (base 2) | 1101100101101 |
| Octal (base 8) | 15455 |
| Hexadecimal (base 16) | 1B2D |
| Base 3 | 100112200 |
| As time | 6957 seconds = 1 h 55 min 57 s |
Is 6957 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 (6957 ÷ 3 = 2319) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (6957 ÷ 9 = 773) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6957 a prime number?
No. 6957 = × 773, so it is divisible by 3.
What are the factors of 6957?
1, 3, 9, 773, 2319, 6957.
What is 6957 in binary?
1101100101101 (hexadecimal 1B2D, octal 15455).
What is the square root of 6957?
About 83.4086, exactly 3√773.
Is 6957 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 6957?
It is a composite number with 6 divisors.