The number 1263
1263 is a composite number with 4 divisors. Its prime factorisation is 3 × 421. Divisors (4): 1, 3, 421, 1263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 1263: a semiprime: 3 × 421, the product of two primes.
- 2
1263 is composite. Its prime factorisation is
- 3
The divisors add up to 1688; without 1263 itself that is 425, so 1263 is deficient (425 is less than 1263). Euler's totient φ(1263) = 840 numbers up to 1263 share no factor with it.
- 4
The digits of 1263 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 176 steps to reach 1.
LaTeX source of the formulas on this page
\[ 1263 = 3 \times 421 \]
1263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 1688 |
| Euler totient φ(n) | 840 |
| Square | 1595169 |
| Cube | 2014698447 |
| Square root | 35.538711 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 176 |
| Scientific notation | 1.263 × |
1263 in other forms
| Form | Value |
|---|---|
| In words | one thousand two hundred and sixty-three |
| Roman numerals | MCCLXIII |
| Binary (base 2) | 10011101111 |
| Octal (base 8) | 2357 |
| Hexadecimal (base 16) | 4EF |
| Base 3 | 1201210 |
| As time | 1263 seconds = 21 min 3 s |
Is 1263 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | No (remainder 1) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (1263 ÷ 3 = 421) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 3) | 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 3) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 3) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 1263 a prime number?
No. 1263 = 3 × 421, so it is divisible by 3.
What are the factors of 1263?
1, 3, 421, 1263.
What is 1263 in binary?
10011101111 (hexadecimal 4EF, octal 2357).
What is the square root of 1263?
About 35.5387.
What is 1263 in Roman numerals?
MCCLXIII.
Is 1263 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 1263?
1263 is a semiprime: 3 × 421, the product of two primes.