The number 30480
30480 is a composite number with 40 divisors. Its prime factorisation is × 3 × 5 × 127. Divisors (40): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48 … 30480.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30480: a Harshad number: divisible by its digit sum 15.
- 2
30480 is composite. Its prime factorisation is
- 3
The divisors add up to 95232; without 30480 itself that is 64752, so 30480 is abundant (64752 is more than 30480). Euler's totient φ(30480) = 8064 numbers up to 30480 share no factor with it.
- 4
The digits of 30480 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 41 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30480 = 2^{4} \times 3 \times 5 \times 127 \]30480 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 40 |
| Sum of divisors | 95232 |
| Euler totient φ(n) | 8064 |
| Square | 929030400 |
| Cube | 28316846592000 |
| Square root | 174.585223 (= 4√1905) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 41 |
| Scientific notation | 3.048 × |
30480 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand four hundred and eighty |
| Binary (base 2) | 111011100010000 |
| Octal (base 8) | 73420 |
| Hexadecimal (base 16) | 7710 |
| Base 3 | 1112210220 |
| As time | 30480 seconds = 8 h 28 min 0 s |
Is 30480 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30480 ÷ 2 = 15240) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (30480 ÷ 3 = 10160) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (30480 ÷ 4 = 7620) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (30480 ÷ 5 = 6096) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (30480 ÷ 6 = 5080) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 | Yes (30480 ÷ 8 = 3810) | 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 (30480 ÷ 10 = 3048) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (30480 ÷ 12 = 2540) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30480 a prime number?
No. 30480 = × 3 × 5 × 127, so it is divisible by 2.
What are the factors of 30480?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 16, 20, 24, 30, 40, 48, 60, 80, 120, 127, 240, 254, 381, 508, 635, 762, 1016, 1270, 1524, 1905, 2032, 2540, 3048, 3810, 5080, 6096, 7620, 10160, 15240, 30480.
What is 30480 in binary?
111011100010000 (hexadecimal 7710, octal 73420).
What is the square root of 30480?
About 174.5852, exactly 4√1905.
Is 30480 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 30480?
30480 is a Harshad number: divisible by its digit sum 15.