The number 6962
6962 is a composite number with 6 divisors. Its prime factorisation is 2 Ć . Divisors (6): 1, 2, 59, 118, 3481, 6962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
6962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
6962 is composite. Its prime factorisation is
- 3
The divisors add up to 10623; without 6962 itself that is 3661, so 6962 is deficient (3661 is less than 6962). Euler's totient Ļ(6962) = 3422 numbers up to 6962 share no factor with it.
- 4
The digits of 6962 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 57 steps to reach 1.
LaTeX source of the formulas on this page
\[ 6962 = 2 \times 59^{2} \]6962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 10623 |
| Euler totient Ļ(n) | 3422 |
| Square | 48469444 |
| Cube | 337444269128 |
| Square root | 83.438600 (= 59ā2) |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 57 |
| Scientific notation | 6.962 Ć |
6962 in other forms
| Form | Value |
|---|---|
| In words | six thousand nine hundred and sixty-two |
| Binary (base 2) | 1101100110010 |
| Octal (base 8) | 15462 |
| Hexadecimal (base 16) | 1B32 |
| Base 3 | 100112212 |
| As time | 6962 seconds = 1 h 56 min 2 s |
Is 6962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (6962 Ć· 2 = 3481) | 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 | No (remainder 2) | 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 4) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | 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 | No (remainder 10) | 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 6962 a prime number?
No. 6962 = 2 Ć , so it is divisible by 2.
What are the factors of 6962?
1, 2, 59, 118, 3481, 6962.
What is 6962 in binary?
1101100110010 (hexadecimal 1B32, octal 15462).
What is the square root of 6962?
About 83.4386, exactly 59ā2.
Is 6962 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 6962?
It is a composite number with 6 divisors.