The number 39030
39030 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1301. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1301, 2602, 3903, 6505, 7806, 13010, 19515, 39030.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 39030: a Harshad number: divisible by its digit sum 15.
- 2
39030 is composite. Its prime factorisation is
- 3
The divisors add up to 93744; without 39030 itself that is 54714, so 39030 is abundant (54714 is more than 39030). Euler's totient φ(39030) = 10400 numbers up to 39030 share no factor with it.
- 4
The digits of 39030 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 155 steps to reach 1.
LaTeX source of the formulas on this page
\[ 39030 = 2 \times 3 \times 5 \times 1301 \]
39030 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 93744 |
| Euler totient φ(n) | 10400 |
| Square | 1523340900 |
| Cube | 59455995327000 |
| Square root | 197.560117 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 155 |
| Scientific notation | 3.903 × |
39030 in other forms
| Form | Value |
|---|---|
| In words | thirty-nine thousand and thirty |
| Binary (base 2) | 1001100001110110 |
| Octal (base 8) | 114166 |
| Hexadecimal (base 16) | 9876 |
| Base 3 | 1222112120 |
| As time | 39030 seconds = 10 h 50 min 30 s |
Is 39030 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (39030 ÷ 2 = 19515) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (39030 ÷ 3 = 13010) | 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 | Yes (39030 ÷ 5 = 7806) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (39030 ÷ 6 = 6505) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (39030 ÷ 10 = 3903) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 39030 a prime number?
No. 39030 = 2 × 3 × 5 × 1301, so it is divisible by 2.
What are the factors of 39030?
1, 2, 3, 5, 6, 10, 15, 30, 1301, 2602, 3903, 6505, 7806, 13010, 19515, 39030.
What is 39030 in binary?
1001100001110110 (hexadecimal 9876, octal 114166).
What is the square root of 39030?
About 197.5601.
Is 39030 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 39030?
39030 is a Harshad number: divisible by its digit sum 15.