The number 57640
57640 is a composite number with 32 divisors. Its prime factorisation is × 5 × 11 × 131. Divisors (32): 1, 2, 4, 5, 8, 10, 11, 20, 22, 40, 44, 55, 88, 110, 131, 220 … 57640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 57640: a Harshad number: divisible by its digit sum 22.
- 2
57640 is composite. Its prime factorisation is
- 3
The divisors add up to 142560; without 57640 itself that is 84920, so 57640 is abundant (84920 is more than 57640). Euler's totient φ(57640) = 20800 numbers up to 57640 share no factor with it.
- 4
The digits of 57640 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 166 steps to reach 1.
LaTeX source of the formulas on this page
\[ 57640 = 2^{3} \times 5 \times 11 \times 131 \]57640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 142560 |
| Euler totient φ(n) | 20800 |
| Square | 3322369600 |
| Cube | 191501383744000 |
| Square root | 240.083319 (= 2√14410) |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 166 |
| Scientific notation | 5.764 × |
57640 in other forms
| Form | Value |
|---|---|
| In words | fifty-seven thousand six hundred and forty |
| Binary (base 2) | 1110000100101000 |
| Octal (base 8) | 160450 |
| Hexadecimal (base 16) | E128 |
| Base 3 | 2221001211 |
| As time | 57640 seconds = 16 h 0 min 40 s |
Is 57640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (57640 ÷ 2 = 28820) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 1) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (57640 ÷ 4 = 14410) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (57640 ÷ 5 = 11528) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 4) | 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 | Yes (57640 ÷ 8 = 7205) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (57640 ÷ 10 = 5764) | A number is divisible by 10 if the last digit is 0. |
| 11 | Yes (57640 ÷ 11 = 5240) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 4) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 57640 a prime number?
No. 57640 = × 5 × 11 × 131, so it is divisible by 2.
What are the factors of 57640?
1, 2, 4, 5, 8, 10, 11, 20, 22, 40, 44, 55, 88, 110, 131, 220, 262, 440, 524, 655, 1048, 1310, 1441, 2620, 2882, 5240, 5764, 7205, 11528, 14410, 28820, 57640.
What is 57640 in binary?
1110000100101000 (hexadecimal E128, octal 160450).
What is the square root of 57640?
About 240.0833, exactly 2√14410.
Is 57640 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 57640?
57640 is a Harshad number: divisible by its digit sum 22.