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