The number 30390
30390 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1013. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1013, 2026, 3039, 5065, 6078, 10130, 15195, 30390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30390: a Harshad number: divisible by its digit sum 15.
- 2
30390 is composite. Its prime factorisation is
- 3
The divisors add up to 73008; without 30390 itself that is 42618, so 30390 is abundant (42618 is more than 30390). Euler's totient φ(30390) = 8096 numbers up to 30390 share no factor with it.
- 4
The digits of 30390 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 134 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30390 = 2 \times 3 \times 5 \times 1013 \]
30390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 73008 |
| Euler totient φ(n) | 8096 |
| Square | 923552100 |
| Cube | 28066748319000 |
| Square root | 174.327278 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 134 |
| Scientific notation | 3.039 × |
30390 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand three hundred and ninety |
| Binary (base 2) | 111011010110110 |
| Octal (base 8) | 73266 |
| Hexadecimal (base 16) | 76B6 |
| Base 3 | 1112200120 |
| As time | 30390 seconds = 8 h 26 min 30 s |
Is 30390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30390 ÷ 2 = 15195) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30390 ÷ 3 = 10130) | 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 (30390 ÷ 5 = 6078) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30390 ÷ 6 = 5065) | 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 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 (30390 ÷ 10 = 3039) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | 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 30390 a prime number?
No. 30390 = 2 × 3 × 5 × 1013, so it is divisible by 2.
What are the factors of 30390?
1, 2, 3, 5, 6, 10, 15, 30, 1013, 2026, 3039, 5065, 6078, 10130, 15195, 30390.
What is 30390 in binary?
111011010110110 (hexadecimal 76B6, octal 73266).
What is the square root of 30390?
About 174.3273.
Is 30390 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30390?
30390 is a Harshad number: divisible by its digit sum 15.