The number 1264
1264 is a composite number with 10 divisors. Its prime factorisation is × 79. Divisors (10): 1, 2, 4, 8, 16, 79, 158, 316, 632, 1264.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1264 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1264 is composite. Its prime factorisation is
- 3
The divisors add up to 2480; without 1264 itself that is 1216, so 1264 is deficient (1216 is less than 1264). Euler's totient φ(1264) = 624 numbers up to 1264 share no factor with it.
- 4
The digits of 1264 add up to 13, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1264 = 2^{4} \times 79 \]1264 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 10 |
| Sum of divisors | 2480 |
| Euler totient φ(n) | 624 |
| Square | 1597696 |
| Cube | 2019487744 |
| Square root | 35.552778 (= 4√79) |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.264 × |
1264 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-four |
| Roman numerals | MCCLXIV |
| Binary (base 2) | 10011110000 |
| Octal (base 8) | 2360 |
| Hexadecimal (base 16) | 4F0 |
| Base 3 | 1201211 |
| As time | 1264 seconds = 21 min 4 s |
Is 1264 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1264 ÷ 2 = 632) | 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 (1264 ÷ 4 = 316) | 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 4) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 (1264 ÷ 8 = 158) | 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 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | 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 1264 a prime number?
No. 1264 = × 79, so it is divisible by 2.
What are the factors of 1264?
1, 2, 4, 8, 16, 79, 158, 316, 632, 1264.
What is 1264 in binary?
10011110000 (hexadecimal 4F0, octal 2360).
What is the square root of 1264?
About 35.5528, exactly 4√79.
What is 1264 in Roman numerals?
MCCLXIV.
Is 1264 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 1264?
It is a composite number with 10 divisors.