The number 11147
11147 is a composite number with 4 divisors. Its prime factorisation is 71 × 157. Divisors (4): 1, 71, 157, 11147.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11147: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 157, the product of two primes.
- 2
11147 is composite. Its prime factorisation is
- 3
The divisors add up to 11376; without 11147 itself that is 229, so 11147 is deficient (229 is less than 11147). Euler's totient φ(11147) = 10920 numbers up to 11147 share no factor with it.
- 4
The digits of 11147 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11147 = 71 \times 157 \]
11147 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11376 |
| Euler totient φ(n) | 10920 |
| Square | 124255609 |
| Cube | 1385077273523 |
| Square root | 105.579354 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1147 × |
11147 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and forty-seven |
| Binary (base 2) | 10101110001011 |
| Octal (base 8) | 25613 |
| Hexadecimal (base 16) | 2B8B |
| Base 3 | 120021212 |
| As time | 11147 seconds = 3 h 5 min 47 s |
Is 11147 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | 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 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 4) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11147 a prime number?
No. 11147 = 71 × 157, so it is divisible by 71.
What are the factors of 11147?
1, 71, 157, 11147.
What is 11147 in binary?
10101110001011 (hexadecimal 2B8B, octal 25613).
What is the square root of 11147?
About 105.5794.
Is 11147 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11147?
11147 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 157, the product of two primes.