The number 11157
11157 is a composite number with 4 divisors. Its prime factorisation is 3 × 3719. Divisors (4): 1, 3, 3719, 11157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11157: a semiprime: 3 × 3719, the product of two primes.
- 2
11157 is composite. Its prime factorisation is
- 3
The divisors add up to 14880; without 11157 itself that is 3723, so 11157 is deficient (3723 is less than 11157). Euler's totient φ(11157) = 7436 numbers up to 11157 share no factor with it.
- 4
The digits of 11157 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 130 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11157 = 3 \times 3719 \]
11157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 14880 |
| Euler totient φ(n) | 7436 |
| Square | 124478649 |
| Cube | 1388808286893 |
| Square root | 105.626701 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 130 |
| Scientific notation | 1.1157 × |
11157 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand one hundred and fifty-seven |
| Binary (base 2) | 10101110010101 |
| Octal (base 8) | 25625 |
| Hexadecimal (base 16) | 2B95 |
| Base 3 | 120022020 |
| As time | 11157 seconds = 3 h 5 min 57 s |
Is 11157 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 | Yes (11157 ÷ 3 = 3719) | 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 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 6) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11157 a prime number?
No. 11157 = 3 × 3719, so it is divisible by 3.
What are the factors of 11157?
1, 3, 3719, 11157.
What is 11157 in binary?
10101110010101 (hexadecimal 2B95, octal 25625).
What is the square root of 11157?
About 105.6267.
Is 11157 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11157?
11157 is a semiprime: 3 × 3719, the product of two primes.