The number 68962
68962 is a composite number with 12 divisors. Its prime factorisation is 2 × × 41. Divisors (12): 1, 2, 29, 41, 58, 82, 841, 1189, 1682, 2378, 34481, 68962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
68962 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
68962 is composite. Its prime factorisation is
- 3
The divisors add up to 109746; without 68962 itself that is 40784, so 68962 is deficient (40784 is less than 68962). Euler's totient φ(68962) = 32480 numbers up to 68962 share no factor with it.
- 4
The digits of 68962 add up to 31, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 68962 = 2 \times 29^{2} \times 41 \]68962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 109746 |
| Euler totient φ(n) | 32480 |
| Square | 4755757444 |
| Cube | 327966544853128 |
| Square root | 262.606169 (= 29√82) |
| Digit sum / digital root | 31 / 4 |
| Collatz steps to 1 | 29 |
| Scientific notation | 6.8962 × |
68962 in other forms
| Form | Value |
|---|---|
| In words | sixty-eight thousand nine hundred and sixty-two |
| Binary (base 2) | 10000110101100010 |
| Octal (base 8) | 206542 |
| Hexadecimal (base 16) | 10D62 |
| Base 3 | 10111121011 |
| As time | 68962 seconds = 19 h 9 min 22 s |
Is 68962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (68962 ÷ 2 = 34481) | 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 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 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 2) | 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 | No (remainder 3) | 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 68962 a prime number?
No. 68962 = 2 × × 41, so it is divisible by 2.
What are the factors of 68962?
1, 2, 29, 41, 58, 82, 841, 1189, 1682, 2378, 34481, 68962.
What is 68962 in binary?
10000110101100010 (hexadecimal 10D62, octal 206542).
What is the square root of 68962?
About 262.6062, exactly 29√82.
Is 68962 divisible by 3?
No. Its digits add up to 31, which is not a multiple of 3.
What is special about the number 68962?
It is a composite number with 12 divisors.