The number 1064
1064 is a composite number with 16 divisors. Its prime factorisation is × 7 × 19. Divisors (16): 1, 2, 4, 7, 8, 14, 19, 28, 38, 56, 76, 133, 152, 266, 532, 1064.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1064 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1064 is composite. Its prime factorisation is
- 3
The divisors add up to 2400; without 1064 itself that is 1336, so 1064 is abundant (1336 is more than 1064). Euler's totient φ(1064) = 432 numbers up to 1064 share no factor with it.
- 4
The digits of 1064 add up to 11, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 31 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1064 = 2^{3} \times 7 \times 19 \]1064 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 2400 |
| Euler totient φ(n) | 432 |
| Square | 1132096 |
| Cube | 1204550144 |
| Square root | 32.619013 (= 2√266) |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 31 |
| Scientific notation | 1.064 × |
1064 in other forms
| Form | Value |
|---|---|
| In words | one thousand and sixty-four |
| Roman numerals | MLXIV |
| Binary (base 2) | 10000101000 |
| Octal (base 8) | 2050 |
| Hexadecimal (base 16) | 428 |
| Base 3 | 1110102 |
| As time | 1064 seconds = 17 min 44 s |
Is 1064 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1064 ÷ 2 = 532) | 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 (1064 ÷ 4 = 266) | 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 | Yes (1064 ÷ 7 = 152) | 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 (1064 ÷ 8 = 133) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 8) | 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 1064 a prime number?
No. 1064 = × 7 × 19, so it is divisible by 2.
What are the factors of 1064?
1, 2, 4, 7, 8, 14, 19, 28, 38, 56, 76, 133, 152, 266, 532, 1064.
What is 1064 in binary?
10000101000 (hexadecimal 428, octal 2050).
What is the square root of 1064?
About 32.6190, exactly 2√266.
What is 1064 in Roman numerals?
MLXIV.
Is 1064 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1064?
It is a composite number with 16 divisors.