The number 39602
39602 is a composite number with 4 divisors. Its prime factorisation is 2 × 19801. Divisors (4): 1, 2, 19801, 39602.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39602: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19801, the product of two primes.
- 2
39602 is composite. Its prime factorisation is
- 3
The divisors add up to 59406; without 39602 itself that is 19804, so 39602 is deficient (19804 is less than 39602). Euler's totient φ(39602) = 19800 numbers up to 39602 share no factor with it.
- 4
The digits of 39602 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
\[ 39602 = 2 \times 19801 \]
39602 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59406 |
| Euler totient φ(n) | 19800 |
| Square | 1568318404 |
| Cube | 62108545435208 |
| Square root | 199.002513 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 137 |
| Scientific notation | 3.9602 × |
39602 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand six hundred and two |
| Binary (base 2) | 1001101010110010 |
| Octal (base 8) | 115262 |
| Hexadecimal (base 16) | 9AB2 |
| Base 3 | 2000022202 |
| As time | 39602 seconds = 11 h 0 min 2 s |
Is 39602 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39602 ÷ 2 = 19801) | 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 3) | 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 39602 a prime number?
No. 39602 = 2 × 19801, so it is divisible by 2.
What are the factors of 39602?
1, 2, 19801, 39602.
What is 39602 in binary?
1001101010110010 (hexadecimal 9AB2, octal 115262).
What is the square root of 39602?
About 199.0025.
Is 39602 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 39602?
39602 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 2 × 19801, the product of two primes.