The number 51690
51690 is a composite number with 16 divisors. Its prime factorisation is 2 × 3 × 5 × 1723. Divisors (16): 1, 2, 3, 5, 6, 10, 15, 30, 1723, 3446, 5169, 8615, 10338, 17230, 25845, 51690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
51690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
51690 is composite. Its prime factorisation is
- 3
The divisors add up to 124128; without 51690 itself that is 72438, so 51690 is abundant (72438 is more than 51690). Euler's totient φ(51690) = 13776 numbers up to 51690 share no factor with it.
- 4
The digits of 51690 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 78 steps to reach 1.
LaTeX source of the formulas on this page
\[ 51690 = 2 \times 3 \times 5 \times 1723 \]
51690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 124128 |
| Euler totient φ(n) | 13776 |
| Square | 2671856100 |
| Cube | 138108241809000 |
| Square root | 227.354349 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 78 |
| Scientific notation | 5.169 × |
51690 in other forms
| Form | Value |
|---|---|
| In words | fifty-one thousand six hundred and ninety |
| Binary (base 2) | 1100100111101010 |
| Octal (base 8) | 144752 |
| Hexadecimal (base 16) | C9EA |
| Base 3 | 2121220110 |
| As time | 51690 seconds = 14 h 21 min 30 s |
Is 51690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (51690 ÷ 2 = 25845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (51690 ÷ 3 = 17230) | 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 (51690 ÷ 5 = 10338) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (51690 ÷ 6 = 8615) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 2) | 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 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (51690 ÷ 10 = 5169) | 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 51690 a prime number?
No. 51690 = 2 × 3 × 5 × 1723, so it is divisible by 2.
What are the factors of 51690?
1, 2, 3, 5, 6, 10, 15, 30, 1723, 3446, 5169, 8615, 10338, 17230, 25845, 51690.
What is 51690 in binary?
1100100111101010 (hexadecimal C9EA, octal 144752).
What is the square root of 51690?
About 227.3543.
Is 51690 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 51690?
It is a composite number with 16 divisors.