The number 5640
5640 is a composite number with 32 divisors. Its prime factorisation is × 3 × 5 × 47. Divisors (32): 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 47, 60 … 5640.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 5640: a Harshad number: divisible by its digit sum 15.
- 2
5640 is composite. Its prime factorisation is
- 3
The divisors add up to 17280; without 5640 itself that is 11640, so 5640 is abundant (11640 is more than 5640). Euler's totient φ(5640) = 1472 numbers up to 5640 share no factor with it.
- 4
The digits of 5640 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 36 steps to reach 1.
LaTeX source of the formulas on this page
\[ 5640 = 2^{3} \times 3 \times 5 \times 47 \]5640 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 32 |
| Sum of divisors | 17280 |
| Euler totient φ(n) | 1472 |
| Square | 31809600 |
| Cube | 179406144000 |
| Square root | 75.099933 (= 2√1410) |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 36 |
| Scientific notation | 5.64 × |
5640 in other forms
| Form | Value |
|---|---|
| In words | five thousand six hundred and forty |
| Binary (base 2) | 1011000001000 |
| Octal (base 8) | 13010 |
| Hexadecimal (base 16) | 1608 |
| Base 3 | 21201220 |
| As time | 5640 seconds = 1 h 34 min 0 s |
Is 5640 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (5640 ÷ 2 = 2820) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (5640 ÷ 3 = 1880) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (5640 ÷ 4 = 1410) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (5640 ÷ 5 = 1128) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (5640 ÷ 6 = 940) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 (5640 ÷ 8 = 705) | 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 (5640 ÷ 10 = 564) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | Yes (5640 ÷ 12 = 470) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 5640 a prime number?
No. 5640 = × 3 × 5 × 47, so it is divisible by 2.
What are the factors of 5640?
1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 30, 40, 47, 60, 94, 120, 141, 188, 235, 282, 376, 470, 564, 705, 940, 1128, 1410, 1880, 2820, 5640.
What is 5640 in binary?
1011000001000 (hexadecimal 1608, octal 13010).
What is the square root of 5640?
About 75.0999, exactly 2√1410.
Is 5640 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 5640?
5640 is a Harshad number: divisible by its digit sum 15.