The number 39062
39062 is a composite number with 4 divisors. Its prime factorisation is 2 × 19531. Divisors (4): 1, 2, 19531, 39062.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39062: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19531, the product of two primes.
- 2
39062 is composite. Its prime factorisation is
- 3
The divisors add up to 58596; without 39062 itself that is 19534, so 39062 is deficient (19534 is less than 39062). Euler's totient φ(39062) = 19530 numbers up to 39062 share no factor with it.
- 4
The digits of 39062 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 137 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39062 = 2 \times 19531 \]
39062 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 58596 |
| Euler totient φ(n) | 19530 |
| Square | 1525839844 |
| Cube | 59602355986328 |
| Square root | 197.641089 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9062 × |
39062 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and sixty-two |
| Binary (base 2) | 1001100010010110 |
| Octal (base 8) | 114226 |
| Hexadecimal (base 16) | 9896 |
| Base 3 | 1222120202 |
| As time | 39062 seconds = 10 h 51 min 2 s |
Is 39062 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39062 ÷ 2 = 19531) | 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 2) | 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 6) | 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 1) | 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 39062 a prime number?
No. 39062 = 2 × 19531, so it is divisible by 2.
What are the factors of 39062?
1, 2, 19531, 39062.
What is 39062 in binary?
1001100010010110 (hexadecimal 9896, octal 114226).
What is the square root of 39062?
About 197.6411.
Is 39062 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 39062?
39062 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19531, the product of two primes.