The number 39962
39962 is a composite number with 16 divisors. Its prime factorisation is 2 × 13 × 29 × 53. Divisors (16): 1, 2, 13, 26, 29, 53, 58, 106, 377, 689, 754, 1378, 1537, 3074, 19981, 39962.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39962: a Harshad number: divisible by its digit sum 29.
- 2
39962 is composite. Its prime factorisation is
- 3
The divisors add up to 68040; without 39962 itself that is 28078, so 39962 is deficient (28078 is less than 39962). Euler's totient φ(39962) = 17472 numbers up to 39962 share no factor with it.
- 4
The digits of 39962 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 93 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39962 = 2 \times 13 \times 29 \times 53 \]
39962 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 68040 |
| Euler totient φ(n) | 17472 |
| Square | 1596961444 |
| Cube | 63817773225128 |
| Square root | 199.904977 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 93 |
| Scientific notation | 3.9962 × |
39962 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand nine hundred and sixty-two |
| Binary (base 2) | 1001110000011010 |
| Octal (base 8) | 116032 |
| Hexadecimal (base 16) | 9C1A |
| Base 3 | 2000211002 |
| As time | 39962 seconds = 11 h 6 min 2 s |
Is 39962 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39962 ÷ 2 = 19981) | 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 6) | 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 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 39962 a prime number?
No. 39962 = 2 × 13 × 29 × 53, so it is divisible by 2.
What are the factors of 39962?
1, 2, 13, 26, 29, 53, 58, 106, 377, 689, 754, 1378, 1537, 3074, 19981, 39962.
What is 39962 in binary?
1001110000011010 (hexadecimal 9C1A, octal 116032).
What is the square root of 39962?
About 199.9050.
Is 39962 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 39962?
39962 is a Harshad number: divisible by its digit sum 29.