The number 51030
51030 is a composite number with 56 divisors. Its prime factorisation is 2 × × 5 × 7. Divisors (56): 1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 27, 30, 35, 42 … 51030.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51030: a Harshad number: divisible by its digit sum 9.
- 2
51030 is composite. Its prime factorisation is
- 3
The divisors add up to 157392; without 51030 itself that is 106362, so 51030 is abundant (106362 is more than 51030). Euler's totient φ(51030) = 11664 numbers up to 51030 share no factor with it.
- 4
The digits of 51030 add up to 9, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51030 = 2 \times 3^{6} \times 5 \times 7 \]51030 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 56 |
| Sum of divisors | 157392 |
| Euler totient φ(n) | 11664 |
| Square | 2604060900 |
| Cube | 132885227727000 |
| Square root | 225.898207 (= 27√70) |
| Digit sum / digital root | 9 / 9 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.103 × |
51030 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and thirty |
| Binary (base 2) | 1100011101010110 |
| Octal (base 8) | 143526 |
| Hexadecimal (base 16) | C756 |
| Base 3 | 2121000000 |
| As time | 51030 seconds = 14 h 10 min 30 s |
Is 51030 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51030 ÷ 2 = 25515) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51030 ÷ 3 = 17010) | 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 (51030 ÷ 5 = 10206) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51030 ÷ 6 = 8505) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51030 ÷ 7 = 7290) | 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 | Yes (51030 ÷ 9 = 5670) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51030 ÷ 10 = 5103) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 51030 a prime number?
No. 51030 = 2 × × 5 × 7, so it is divisible by 2.
What are the factors of 51030?
1, 2, 3, 5, 6, 7, 9, 10, 14, 15, 18, 21, 27, 30, 35, 42, 45, 54, 63, 70, 81, 90, 105, 126, 135, 162, 189, 210, 243, 270, 315, 378, 405, 486, 567, 630, 729, 810, 945, 1134, 1215, 1458, 1701, 1890, 2430, 2835, 3402, 3645, 5103, 5670, 7290, 8505, 10206, 17010, 25515, 51030.
What is 51030 in binary?
1100011101010110 (hexadecimal C756, octal 143526).
What is the square root of 51030?
About 225.8982, exactly 27√70.
Is 51030 divisible by 3?
Yes. Its digits add up to 9, a multiple of 3.
What is special about the number 51030?
51030 is a Harshad number: divisible by its digit sum 9.