The number 11146
11146 is a composite number with 4 divisors. Its prime factorisation is 2 × 5573. Divisors (4): 1, 2, 5573, 11146.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11146: a semiprime: 2 × 5573, the product of two primes.
- 2
11146 is composite. Its prime factorisation is
- 3
The divisors add up to 16722; without 11146 itself that is 5576, so 11146 is deficient (5576 is less than 11146). Euler's totient φ(11146) = 5572 numbers up to 11146 share no factor with it.
- 4
The digits of 11146 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 37 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11146 = 2 \times 5573 \]
11146 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 16722 |
| Euler totient φ(n) | 5572 |
| Square | 124233316 |
| Cube | 1384704540136 |
| Square root | 105.574618 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 37 |
| Scientific notation | 1.1146 × |
11146 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and forty-six |
| Binary (base 2) | 10101110001010 |
| Octal (base 8) | 25612 |
| Hexadecimal (base 16) | 2B8A |
| Base 3 | 120021211 |
| As time | 11146 seconds = 3 h 5 min 46 s |
Is 11146 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11146 ÷ 2 = 5573) | 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 2) | 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 4) | 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 2) | 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 6) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 10) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11146 a prime number?
No. 11146 = 2 × 5573, so it is divisible by 2.
What are the factors of 11146?
1, 2, 5573, 11146.
What is 11146 in binary?
10101110001010 (hexadecimal 2B8A, octal 25612).
What is the square root of 11146?
About 105.5746.
Is 11146 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 11146?
11146 is a semiprime: 2 × 5573, the product of two primes.