The number 51390
51390 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 571. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 571, 1142, 1713, 2855 … 51390.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51390: a Harshad number: divisible by its digit sum 18.
- 2
51390 is composite. Its prime factorisation is
- 3
The divisors add up to 133848; without 51390 itself that is 82458, so 51390 is abundant (82458 is more than 51390). Euler's totient φ(51390) = 13680 numbers up to 51390 share no factor with it.
- 4
The digits of 51390 add up to 18, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51390 = 2 \times 3^{2} \times 5 \times 571 \]51390 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 133848 |
| Euler totient φ(n) | 13680 |
| Square | 2640932100 |
| Cube | 135717500619000 |
| Square root | 226.693626 (= 3√5710) |
| Digit sum / digital root | 18 / 9 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.139 × |
51390 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand three hundred and ninety |
| Binary (base 2) | 1100100010111110 |
| Octal (base 8) | 144276 |
| Hexadecimal (base 16) | C8BE |
| Base 3 | 2121111100 |
| As time | 51390 seconds = 14 h 16 min 30 s |
Is 51390 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51390 ÷ 2 = 25695) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51390 ÷ 3 = 17130) | 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 (51390 ÷ 5 = 10278) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51390 ÷ 6 = 8565) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 (51390 ÷ 9 = 5710) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51390 ÷ 10 = 5139) | 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 51390 a prime number?
No. 51390 = 2 × × 5 × 571, so it is divisible by 2.
What are the factors of 51390?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 571, 1142, 1713, 2855, 3426, 5139, 5710, 8565, 10278, 17130, 25695, 51390.
What is 51390 in binary?
1100100010111110 (hexadecimal C8BE, octal 144276).
What is the square root of 51390?
About 226.6936, exactly 3√5710.
Is 51390 divisible by 3?
Yes. Its digits add up to 18, a multiple of 3.
What is special about the number 51390?
51390 is a Harshad number: divisible by its digit sum 18.