The number 11269
11269 is a composite number with 4 divisors. Its prime factorisation is 59 × 191. Divisors (4): 1, 59, 191, 11269.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11269: a semiprime: 59 × 191, the product of two primes.
- 2
11269 is composite. Its prime factorisation is
- 3
The divisors add up to 11520; without 11269 itself that is 251, so 11269 is deficient (251 is less than 11269). Euler's totient φ(11269) = 11020 numbers up to 11269 share no factor with it.
- 4
The digits of 11269 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11269 = 59 \times 191 \]
11269 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11520 |
| Euler totient φ(n) | 11020 |
| Square | 126990361 |
| Cube | 1431054378109 |
| Square root | 106.155546 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.1269 × |
11269 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and sixty-nine |
| Binary (base 2) | 10110000000101 |
| Octal (base 8) | 26005 |
| Hexadecimal (base 16) | 2C05 |
| Base 3 | 120110101 |
| As time | 11269 seconds = 3 h 7 min 49 s |
Is 11269 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11269 a prime number?
No. 11269 = 59 × 191, so it is divisible by 59.
What are the factors of 11269?
1, 59, 191, 11269.
What is 11269 in binary?
10110000000101 (hexadecimal 2C05, octal 26005).
What is the square root of 11269?
About 106.1555.
Is 11269 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11269?
11269 is a semiprime: 59 × 191, the product of two primes.