The number 11141
11141 is a composite number with 4 divisors. Its prime factorisation is 13 × 857. Divisors (4): 1, 13, 857, 11141.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11141: a semiprime: 13 × 857, the product of two primes.
- 2
11141 is composite. Its prime factorisation is
- 3
The divisors add up to 12012; without 11141 itself that is 871, so 11141 is deficient (871 is less than 11141). Euler's totient φ(11141) = 10272 numbers up to 11141 share no factor with it.
- 4
The digits of 11141 add up to 8, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11141 = 13 \times 857 \]
11141 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 12012 |
| Euler totient φ(n) | 10272 |
| Square | 124121881 |
| Cube | 1382841876221 |
| Square root | 105.550936 |
| Digit sum / digital root | 8 / 8 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1141 × |
11141 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and forty-one |
| Binary (base 2) | 10101110000101 |
| Octal (base 8) | 25605 |
| Hexadecimal (base 16) | 2B85 |
| Base 3 | 120021122 |
| As time | 11141 seconds = 3 h 5 min 41 s |
Is 11141 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 2) | 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 1) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 4) | 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 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11141 a prime number?
No. 11141 = 13 × 857, so it is divisible by 13.
What are the factors of 11141?
1, 13, 857, 11141.
What is 11141 in binary?
10101110000101 (hexadecimal 2B85, octal 25605).
What is the square root of 11141?
About 105.5509.
Is 11141 divisible by 3?
No. Its digits add up to 8, which is not a multiple of 3.
What is special about the number 11141?
11141 is a semiprime: 13 × 857, the product of two primes.