The number 1268
1268 is a composite number with 6 divisors. Its prime factorisation is × 317. Divisors (6): 1, 2, 4, 317, 634, 1268.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
1268 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
1268 is composite. Its prime factorisation is
- 3
The divisors add up to 2226; without 1268 itself that is 958, so 1268 is deficient (958 is less than 1268). Euler's totient φ(1268) = 632 numbers up to 1268 share no factor with it.
- 4
The digits of 1268 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1268 = 2^{2} \times 317 \]1268 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 6 |
| Sum of divisors | 2226 |
| Euler totient φ(n) | 632 |
| Square | 1607824 |
| Cube | 2038720832 |
| Square root | 35.608988 (= 2√317) |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.268 × |
1268 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-eight |
| Roman numerals | MCCLXVIII |
| Binary (base 2) | 10011110100 |
| Octal (base 8) | 2364 |
| Hexadecimal (base 16) | 4F4 |
| Base 3 | 1201222 |
| As time | 1268 seconds = 21 min 8 s |
Is 1268 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1268 ÷ 2 = 634) | 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 (1268 ÷ 4 = 317) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 1) | 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 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | 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 1268 a prime number?
No. 1268 = × 317, so it is divisible by 2.
What are the factors of 1268?
1, 2, 4, 317, 634, 1268.
What is 1268 in binary?
10011110100 (hexadecimal 4F4, octal 2364).
What is the square root of 1268?
About 35.6090, exactly 2√317.
What is 1268 in Roman numerals?
MCCLXVIII.
Is 1268 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 1268?
It is a composite number with 6 divisors.