The number 30520
30520 is a composite number with 32 divisors. Its prime factorisation is × 5 × 7 × 109. Divisors (32): 1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 109, 140 … 30520.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 30520: a Harshad number: divisible by its digit sum 10.
- 2
30520 is composite. Its prime factorisation is
- 3
The divisors add up to 79200; without 30520 itself that is 48680, so 30520 is abundant (48680 is more than 30520). Euler's totient φ(30520) = 10368 numbers up to 30520 share no factor with it.
- 4
The digits of 30520 add up to 10, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 178 steps to reach 1.
LaTeX source of the formulas on this page
\[ 30520 = 2^{3} \times 5 \times 7 \times 109 \]30520 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 79200 |
| Euler totient φ(n) | 10368 |
| Square | 931470400 |
| Cube | 28428476608000 |
| Square root | 174.699742 (= 2√7630) |
| Digit sum / digital root | 10 / 1 |
| Collatz steps to 1 | 178 |
| Scientific notation | 3.052 × |
30520 in other forms
| Form | Value |
|---|---|
| In words | thirty thousand five hundred and twenty |
| Binary (base 2) | 111011100111000 |
| Octal (base 8) | 73470 |
| Hexadecimal (base 16) | 7738 |
| Base 3 | 1112212101 |
| As time | 30520 seconds = 8 h 28 min 40 s |
Is 30520 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (30520 ÷ 2 = 15260) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (30520 ÷ 4 = 7630) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (30520 ÷ 5 = 6104) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (30520 ÷ 7 = 4360) | 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 (30520 ÷ 8 = 3815) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (30520 ÷ 10 = 3052) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 30520 a prime number?
No. 30520 = × 5 × 7 × 109, so it is divisible by 2.
What are the factors of 30520?
1, 2, 4, 5, 7, 8, 10, 14, 20, 28, 35, 40, 56, 70, 109, 140, 218, 280, 436, 545, 763, 872, 1090, 1526, 2180, 3052, 3815, 4360, 6104, 7630, 15260, 30520.
What is 30520 in binary?
111011100111000 (hexadecimal 7738, octal 73470).
What is the square root of 30520?
About 174.6997, exactly 2√7630.
Is 30520 divisible by 3?
No. Its digits add up to 10, which is not a multiple of 3.
What is special about the number 30520?
30520 is a Harshad number: divisible by its digit sum 10.