The number 83962
83962 is a composite number with 4 divisors. Its prime factorisation is 2 × 41981. Divisors (4): 1, 2, 41981, 83962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 83962: a semiprime: 2 × 41981, the product of two primes.
- 2
83962 is composite. Its prime factorisation is
- 3
The divisors add up to 125946; without 83962 itself that is 41984, so 83962 is deficient (41984 is less than 83962). Euler's totient φ(83962) = 41980 numbers up to 83962 share no factor with it.
- 4
The digits of 83962 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 89 steps to reach 1.
LaTeX source of the formulas on this page
\[ 83962 = 2 \times 41981 \]
83962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 125946 |
| Euler totient φ(n) | 41980 |
| Square | 7049617444 |
| Cube | 591899979833128 |
| Square root | 289.761971 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 89 |
| Scientific notation | 8.3962 × |
83962 in other forms
| Form | Value |
|---|---|
| In words | eighty-three thousand nine hundred and sixty-two |
| Binary (base 2) | 10100011111111010 |
| Octal (base 8) | 243772 |
| Hexadecimal (base 16) | 147FA |
| Base 3 | 11021011201 |
| As time | 83962 seconds = 23 h 19 min 22 s |
Is 83962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (83962 ÷ 2 = 41981) | 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 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 1) | 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 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 83962 a prime number?
No. 83962 = 2 × 41981, so it is divisible by 2.
What are the factors of 83962?
1, 2, 41981, 83962.
What is 83962 in binary?
10100011111111010 (hexadecimal 147FA, octal 243772).
What is the square root of 83962?
About 289.7620.
Is 83962 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 83962?
83962 is a semiprime: 2 × 41981, the product of two primes.