The number 51630
51630 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1721. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1721, 3442, 5163, 8605, 10326, 17210, 25815, 51630.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51630: a Harshad number: divisible by its digit sum 15.
- 2
51630 is composite. Its prime factorisation is
- 3
The divisors add up to 123984; without 51630 itself that is 72354, so 51630 is abundant (72354 is more than 51630). Euler's totient φ(51630) = 13760 numbers up to 51630 share no factor with it.
- 4
The digits of 51630 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 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51630 = 2 \times 3 \times 5 \times 1721 \]
51630 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 123984 |
| Euler totient φ(n) | 13760 |
| Square | 2665656900 |
| Cube | 137627865747000 |
| Square root | 227.222358 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.163 × |
51630 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and thirty |
| Binary (base 2) | 1100100110101110 |
| Octal (base 8) | 144656 |
| Hexadecimal (base 16) | C9AE |
| Base 3 | 2121211020 |
| As time | 51630 seconds = 14 h 20 min 30 s |
Is 51630 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51630 ÷ 2 = 25815) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51630 ÷ 3 = 17210) | 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 (51630 ÷ 5 = 10326) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51630 ÷ 6 = 8605) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (51630 ÷ 10 = 5163) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 51630 a prime number?
No. 51630 = 2 × 3 × 5 × 1721, so it is divisible by 2.
What are the factors of 51630?
1, 2, 3, 5, 6, 10, 15, 30, 1721, 3442, 5163, 8605, 10326, 17210, 25815, 51630.
What is 51630 in binary?
1100100110101110 (hexadecimal C9AE, octal 144656).
What is the square root of 51630?
About 227.2224.
Is 51630 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51630?
51630 is a Harshad number: divisible by its digit sum 15.