The number 2564
2564 is a composite number with 6 divisors. Its prime factorisation is × 641. Divisors (6): 1, 2, 4, 641, 1282, 2564.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
2564 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
2564 is composite. Its prime factorisation is
- 3
The divisors add up to 4494; without 2564 itself that is 1930, so 2564 is deficient (1930 is less than 2564). Euler's totient φ(2564) = 1280 numbers up to 2564 share no factor with it.
- 4
The digits of 2564 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 53 steps to reach 1.
LaTeX source of the formulas on this page
\[ 2564 = 2^{2} \times 641 \]2564 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 4494 |
| Euler totient φ(n) | 1280 |
| Square | 6574096 |
| Cube | 16855982144 |
| Square root | 50.635956 (= 2√641) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 53 |
| Scientific notation | 2.564 × |
2564 in other forms
| Form | Value |
|---|---|
| In words | two thousand five hundred and sixty-four |
| Roman numerals | MMDLXIV |
| Binary (base 2) | 101000000100 |
| Octal (base 8) | 5004 |
| Hexadecimal (base 16) | A04 |
| Base 3 | 10111222 |
| As time | 2564 seconds = 42 min 44 s |
Is 2564 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (2564 ÷ 2 = 1282) | 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 | Yes (2564 ÷ 4 = 641) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 | 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 4) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | 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 8) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 2564 a prime number?
No. 2564 = × 641, so it is divisible by 2.
What are the factors of 2564?
1, 2, 4, 641, 1282, 2564.
What is 2564 in binary?
101000000100 (hexadecimal A04, octal 5004).
What is the square root of 2564?
About 50.6360, exactly 2√641.
What is 2564 in Roman numerals?
MMDLXIV.
Is 2564 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 2564?
It is a composite number with 6 divisors.