The number 11263
11263 is a composite number with 4 divisors. Its prime factorisation is 7 × 1609. Divisors (4): 1, 7, 1609, 11263.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11263: a semiprime: 7 × 1609, the product of two primes.
- 2
11263 is composite. Its prime factorisation is
- 3
The divisors add up to 12880; without 11263 itself that is 1617, so 11263 is deficient (1617 is less than 11263). Euler's totient φ(11263) = 9648 numbers up to 11263 share no factor with it.
- 4
The digits of 11263 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 205 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11263 = 7 \times 1609 \]
11263 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12880 |
| Euler totient φ(n) | 9648 |
| Square | 126855169 |
| Cube | 1428769768447 |
| Square root | 106.127282 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 205 |
| Scientific notation | 1.1263 × |
11263 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and sixty-three |
| Binary (base 2) | 10101111111111 |
| Octal (base 8) | 25777 |
| Hexadecimal (base 16) | 2BFF |
| Base 3 | 120110011 |
| As time | 11263 seconds = 3 h 7 min 43 s |
Is 11263 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 | No (remainder 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (11263 ÷ 7 = 1609) | 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 4) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11263 a prime number?
No. 11263 = 7 × 1609, so it is divisible by 7.
What are the factors of 11263?
1, 7, 1609, 11263.
What is 11263 in binary?
10101111111111 (hexadecimal 2BFF, octal 25777).
What is the square root of 11263?
About 106.1273.
Is 11263 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11263?
11263 is a semiprime: 7 × 1609, the product of two primes.