The number 3962
3962 is a composite number with 8 divisors. Its prime factorisation is 2 × 7 × 283. Divisors (8): 1, 2, 7, 14, 283, 566, 1981, 3962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 3962: a happy number: repeatedly adding the squares of its digits reaches 1.
- 2
3962 is composite. Its prime factorisation is
- 3
The divisors add up to 6816; without 3962 itself that is 2854, so 3962 is deficient (2854 is less than 3962). Euler's totient φ(3962) = 1692 numbers up to 3962 share no factor with it.
- 4
The digits of 3962 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 100 steps to reach 1.
LaTeX source of the formulas on this page
\[ 3962 = 2 \times 7 \times 283 \]
3962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 6816 |
| Euler totient φ(n) | 1692 |
| Square | 15697444 |
| Cube | 62193273128 |
| Square root | 62.944420 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 100 |
| Scientific notation | 3.962 × |
3962 in other forms
| Form | Value |
|---|---|
| In words | three thousand nine hundred and sixty-two |
| Roman numerals | MMMCMLXII |
| Binary (base 2) | 111101111010 |
| Octal (base 8) | 7572 |
| Hexadecimal (base 16) | F7A |
| Base 3 | 12102202 |
| As time | 3962 seconds = 1 h 6 min 2 s |
Is 3962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (3962 ÷ 2 = 1981) | 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 | Yes (3962 ÷ 7 = 566) | 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 2) | 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 2) | 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 3962 a prime number?
No. 3962 = 2 × 7 × 283, so it is divisible by 2.
What are the factors of 3962?
1, 2, 7, 14, 283, 566, 1981, 3962.
What is 3962 in binary?
111101111010 (hexadecimal F7A, octal 7572).
What is the square root of 3962?
About 62.9444.
What is 3962 in Roman numerals?
MMMCMLXII.
Is 3962 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 3962?
3962 is a happy number: repeatedly adding the squares of its digits reaches 1.