The number 51090
51090 is a composite number with 32 divisors. Its prime factorisation is 2 × 3 × 5 × 13 × 131. Divisors (32): 1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 131, 195 … 51090.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 51090: a Harshad number: divisible by its digit sum 15.
- 2
51090 is composite. Its prime factorisation is
- 3
The divisors add up to 133056; without 51090 itself that is 81966, so 51090 is abundant (81966 is more than 51090). Euler's totient φ(51090) = 12480 numbers up to 51090 share no factor with it.
- 4
The digits of 51090 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 158 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51090 = 2 \times 3 \times 5 \times 13 \times 131 \]
51090 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 133056 |
| Euler totient φ(n) | 12480 |
| Square | 2610188100 |
| Cube | 133354510029000 |
| Square root | 226.030971 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 158 |
| Scientific notation | 5.109 × |
51090 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand and ninety |
| Binary (base 2) | 1100011110010010 |
| Octal (base 8) | 143622 |
| Hexadecimal (base 16) | C792 |
| Base 3 | 2121002020 |
| As time | 51090 seconds = 14 h 11 min 30 s |
Is 51090 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51090 ÷ 2 = 25545) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51090 ÷ 3 = 17030) | 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 (51090 ÷ 5 = 10218) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51090 ÷ 6 = 8515) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 2) | 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 (51090 ÷ 10 = 5109) | 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 6) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51090 a prime number?
No. 51090 = 2 × 3 × 5 × 13 × 131, so it is divisible by 2.
What are the factors of 51090?
1, 2, 3, 5, 6, 10, 13, 15, 26, 30, 39, 65, 78, 130, 131, 195, 262, 390, 393, 655, 786, 1310, 1703, 1965, 3406, 3930, 5109, 8515, 10218, 17030, 25545, 51090.
What is 51090 in binary?
1100011110010010 (hexadecimal C792, octal 143622).
What is the square root of 51090?
About 226.0310.
Is 51090 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 51090?
51090 is a Harshad number: divisible by its digit sum 15.