The number 30930
30930 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1031. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1031, 2062, 3093, 5155, 6186, 10310, 15465, 30930.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30930: a Harshad number: divisible by its digit sum 15.
- 2
30930 is composite. Its prime factorisation is
- 3
The divisors add up to 74304; without 30930 itself that is 43374, so 30930 is abundant (43374 is more than 30930). Euler's totient φ(30930) = 8240 numbers up to 30930 share no factor with it.
- 4
The digits of 30930 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 209 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30930 = 2 \times 3 \times 5 \times 1031 \]
30930 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 74304 |
| Euler totient φ(n) | 8240 |
| Square | 956664900 |
| Cube | 29589645357000 |
| Square root | 175.869270 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 209 |
| Scientific notation | 3.093 × |
30930 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand nine hundred and thirty |
| Binary (base 2) | 111100011010010 |
| Octal (base 8) | 74322 |
| Hexadecimal (base 16) | 78D2 |
| Base 3 | 1120102120 |
| As time | 30930 seconds = 8 h 35 min 30 s |
Is 30930 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30930 ÷ 2 = 15465) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30930 ÷ 3 = 10310) | 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 (30930 ÷ 5 = 6186) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30930 ÷ 6 = 5155) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (30930 ÷ 10 = 3093) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 30930 a prime number?
No. 30930 = 2 × 3 × 5 × 1031, so it is divisible by 2.
What are the factors of 30930?
1, 2, 3, 5, 6, 10, 15, 30, 1031, 2062, 3093, 5155, 6186, 10310, 15465, 30930.
What is 30930 in binary?
111100011010010 (hexadecimal 78D2, octal 74322).
What is the square root of 30930?
About 175.8693.
Is 30930 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30930?
30930 is a Harshad number: divisible by its digit sum 15.