The number 63962
63962 is a composite number with 4 divisors. Its prime factorisation is 2 × 31981. Divisors (4): 1, 2, 31981, 63962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 63962: a semiprime: 2 × 31981, the product of two primes.
- 2
63962 is composite. Its prime factorisation is
- 3
The divisors add up to 95946; without 63962 itself that is 31984, so 63962 is deficient (31984 is less than 63962). Euler's totient φ(63962) = 31980 numbers up to 63962 share no factor with it.
- 4
The digits of 63962 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 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 63962 = 2 \times 31981 \]
63962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 95946 |
| Euler totient φ(n) | 31980 |
| Square | 4091137444 |
| Cube | 261677333193128 |
| Square root | 252.907098 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 55 |
| Scientific notation | 6.3962 × |
63962 in other forms
| Form | Value |
|---|---|
| In words | sixty-three thousand nine hundred and sixty-two |
| Binary (base 2) | 1111100111011010 |
| Octal (base 8) | 174732 |
| Hexadecimal (base 16) | F9DA |
| Base 3 | 10020201222 |
| As time | 63962 seconds = 17 h 46 min 2 s |
Is 63962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (63962 ÷ 2 = 31981) | 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 3) | 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 8) | 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 8) | 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 63962 a prime number?
No. 63962 = 2 × 31981, so it is divisible by 2.
What are the factors of 63962?
1, 2, 31981, 63962.
What is 63962 in binary?
1111100111011010 (hexadecimal F9DA, octal 174732).
What is the square root of 63962?
About 252.9071.
Is 63962 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 63962?
63962 is a semiprime: 2 × 31981, the product of two primes.