The number 6952
6952 is a composite number with 16 divisors. Its prime factorisation is × 11 × 79. Divisors (16): 1, 2, 4, 8, 11, 22, 44, 79, 88, 158, 316, 632, 869, 1738, 3476, 6952.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 6952: a Harshad number: divisible by its digit sum 22.
- 2
6952 is composite. Its prime factorisation is
- 3
The divisors add up to 14400; without 6952 itself that is 7448, so 6952 is abundant (7448 is more than 6952). Euler's totient φ(6952) = 3120 numbers up to 6952 share no factor with it.
- 4
The digits of 6952 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6952 = 2^{3} \times 11 \times 79 \]6952 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 14400 |
| Euler totient φ(n) | 3120 |
| Square | 48330304 |
| Cube | 335992273408 |
| Square root | 83.378654 (= 2√1738) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 31 |
| Scientific notation | 6.952 × |
6952 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and fifty-two |
| Binary (base 2) | 1101100101000 |
| Octal (base 8) | 15450 |
| Hexadecimal (base 16) | 1B28 |
| Base 3 | 100112111 |
| As time | 6952 seconds = 1 h 55 min 52 s |
Is 6952 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6952 ÷ 2 = 3476) | 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 | Yes (6952 ÷ 4 = 1738) | 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 4) | 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 | Yes (6952 ÷ 8 = 869) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (6952 ÷ 11 = 632) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 6952 a prime number?
No. 6952 = × 11 × 79, so it is divisible by 2.
What are the factors of 6952?
1, 2, 4, 8, 11, 22, 44, 79, 88, 158, 316, 632, 869, 1738, 3476, 6952.
What is 6952 in binary?
1101100101000 (hexadecimal 1B28, octal 15450).
What is the square root of 6952?
About 83.3787, exactly 2√1738.
Is 6952 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 6952?
6952 is a Harshad number: divisible by its digit sum 22.