The number 1262
1262 is a composite number with 4 divisors. Its prime factorisation is 2 × 631. Divisors (4): 1, 2, 631, 1262.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1262: a semiprime: 2 × 631, the product of two primes.
- 2
1262 is composite. Its prime factorisation is
- 3
The divisors add up to 1896; without 1262 itself that is 634, so 1262 is deficient (634 is less than 1262). Euler's totient φ(1262) = 630 numbers up to 1262 share no factor with it.
- 4
The digits of 1262 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 39 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1262 = 2 \times 631 \]
1262 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1896 |
| Euler totient φ(n) | 630 |
| Square | 1592644 |
| Cube | 2009916728 |
| Square root | 35.524639 |
| Digit sum / digital root | 11 / 2 |
| Collatz steps to 1 | 39 |
| Scientific notation | 1.262 × |
1262 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-two |
| Roman numerals | MCCLXII |
| Binary (base 2) | 10011101110 |
| Octal (base 8) | 2356 |
| Hexadecimal (base 16) | 4EE |
| Base 3 | 1201202 |
| As time | 1262 seconds = 21 min 2 s |
Is 1262 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (1262 ÷ 2 = 631) | 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 | No (remainder 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 6) | 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 2) | 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 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1262 a prime number?
No. 1262 = 2 × 631, so it is divisible by 2.
What are the factors of 1262?
1, 2, 631, 1262.
What is 1262 in binary?
10011101110 (hexadecimal 4EE, octal 2356).
What is the square root of 1262?
About 35.5246.
What is 1262 in Roman numerals?
MCCLXII.
Is 1262 divisible by 3?
No. Its digits add up to 11, which is not a multiple of 3.
What is special about the number 1262?
1262 is a semiprime: 2 × 631, the product of two primes.