The number 57690
57690 is a composite number with 24 divisors. Its prime factorisation is 2 × × 5 × 641. Divisors (24): 1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 641, 1282, 1923, 3205 … 57690.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
57690 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
57690 is composite. Its prime factorisation is
- 3
The divisors add up to 150228; without 57690 itself that is 92538, so 57690 is abundant (92538 is more than 57690). Euler's totient φ(57690) = 15360 numbers up to 57690 share no factor with it.
- 4
The digits of 57690 add up to 27, and repeating that until one digit is left gives the digital root 9. The Collatz sequence (halve if even, else 3n+1) takes 122 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57690 = 2 \times 3^{2} \times 5 \times 641 \]57690 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 150228 |
| Euler totient φ(n) | 15360 |
| Square | 3328136100 |
| Cube | 192000171609000 |
| Square root | 240.187427 (= 3√6410) |
| Digit sum / digital root | 27 / 9 |
| Collatz steps to 1 | 122 |
| Scientific notation | 5.769 × |
57690 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand six hundred and ninety |
| Binary (base 2) | 1110000101011010 |
| Octal (base 8) | 160532 |
| Hexadecimal (base 16) | E15A |
| Base 3 | 2221010200 |
| As time | 57690 seconds = 16 h 1 min 30 s |
Is 57690 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57690 ÷ 2 = 28845) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (57690 ÷ 3 = 19230) | 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 (57690 ÷ 5 = 11538) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (57690 ÷ 6 = 9615) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | Yes (57690 ÷ 9 = 6410) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (57690 ÷ 10 = 5769) | 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 57690 a prime number?
No. 57690 = 2 × × 5 × 641, so it is divisible by 2.
What are the factors of 57690?
1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 641, 1282, 1923, 3205, 3846, 5769, 6410, 9615, 11538, 19230, 28845, 57690.
What is 57690 in binary?
1110000101011010 (hexadecimal E15A, octal 160532).
What is the square root of 57690?
About 240.1874, exactly 3√6410.
Is 57690 divisible by 3?
Yes. Its digits add up to 27, a multiple of 3.
What is special about the number 57690?
It is a composite number with 24 divisors.