The number 39362
39362 is a composite number with 4 divisors. Its prime factorisation is 2 × 19681. Divisors (4): 1, 2, 19681, 39362.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39362: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19681, the product of two primes.
- 2
39362 is composite. Its prime factorisation is
- 3
The divisors add up to 59046; without 39362 itself that is 19684, so 39362 is deficient (19684 is less than 39362). Euler's totient φ(39362) = 19680 numbers up to 39362 share no factor with it.
- 4
The digits of 39362 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39362 = 2 \times 19681 \]
39362 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59046 |
| Euler totient φ(n) | 19680 |
| Square | 1549367044 |
| Cube | 60986185585928 |
| Square root | 198.398589 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9362 × |
39362 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand three hundred and sixty-two |
| Binary (base 2) | 1001100111000010 |
| Octal (base 8) | 114702 |
| Hexadecimal (base 16) | 99C2 |
| Base 3 | 1222222212 |
| As time | 39362 seconds = 10 h 56 min 2 s |
Is 39362 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39362 ÷ 2 = 19681) | 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 1) | 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 5) | 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 4) | 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 39362 a prime number?
No. 39362 = 2 × 19681, so it is divisible by 2.
What are the factors of 39362?
1, 2, 19681, 39362.
What is 39362 in binary?
1001100111000010 (hexadecimal 99C2, octal 114702).
What is the square root of 39362?
About 198.3986.
Is 39362 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 39362?
39362 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19681, the product of two primes.