The number 51590
51590 is a composite number with 32 divisors. Its prime factorisation is 2 × 5 × 7 × 11 × 67. Divisors (32): 1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 67, 70, 77, 110, 134, 154 … 51590.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51590 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51590 is composite. Its prime factorisation is
- 3
The divisors add up to 117504; without 51590 itself that is 65914, so 51590 is abundant (65914 is more than 51590). Euler's totient φ(51590) = 15840 numbers up to 51590 share no factor with it.
- 4
The digits of 51590 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 65 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51590 = 2 \times 5 \times 7 \times 11 \times 67 \]
51590 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 117504 |
| Euler totient φ(n) | 15840 |
| Square | 2661528100 |
| Cube | 137308234679000 |
| Square root | 227.134321 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 65 |
| Scientific notation | 5.159 × |
51590 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand five hundred and ninety |
| Binary (base 2) | 1100100110000110 |
| Octal (base 8) | 144606 |
| Hexadecimal (base 16) | C986 |
| Base 3 | 2121202202 |
| As time | 51590 seconds = 14 h 19 min 50 s |
Is 51590 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51590 ÷ 2 = 25795) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | 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 (51590 ÷ 5 = 10318) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (51590 ÷ 7 = 7370) | 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 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51590 ÷ 10 = 5159) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (51590 ÷ 11 = 4690) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 51590 a prime number?
No. 51590 = 2 × 5 × 7 × 11 × 67, so it is divisible by 2.
What are the factors of 51590?
1, 2, 5, 7, 10, 11, 14, 22, 35, 55, 67, 70, 77, 110, 134, 154, 335, 385, 469, 670, 737, 770, 938, 1474, 2345, 3685, 4690, 5159, 7370, 10318, 25795, 51590.
What is 51590 in binary?
1100100110000110 (hexadecimal C986, octal 144606).
What is the square root of 51590?
About 227.1343.
Is 51590 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 51590?
It is a composite number with 32 divisors.