The number 11557
11557 is a composite number with 8 divisors. Its prime factorisation is 7 × 13 × 127. Divisors (8): 1, 7, 13, 91, 127, 889, 1651, 11557.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11557 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11557 is composite. Its prime factorisation is
- 3
The divisors add up to 14336; without 11557 itself that is 2779, so 11557 is deficient (2779 is less than 11557). Euler's totient φ(11557) = 9072 numbers up to 11557 share no factor with it.
- 4
The digits of 11557 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11557 = 7 \times 13 \times 127 \]
11557 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14336 |
| Euler totient φ(n) | 9072 |
| Square | 133564249 |
| Cube | 1543602025693 |
| Square root | 107.503488 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1557 × |
11557 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and fifty-seven |
| Binary (base 2) | 10110100100101 |
| Octal (base 8) | 26445 |
| Hexadecimal (base 16) | 2D25 |
| Base 3 | 120212001 |
| As time | 11557 seconds = 3 h 12 min 37 s |
Is 11557 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 2) | 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 | Yes (11557 ÷ 7 = 1651) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | 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 11557 a prime number?
No. 11557 = 7 × 13 × 127, so it is divisible by 7.
What are the factors of 11557?
1, 7, 13, 91, 127, 889, 1651, 11557.
What is 11557 in binary?
10110100100101 (hexadecimal 2D25, octal 26445).
What is the square root of 11557?
About 107.5035.
Is 11557 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11557?
It is a composite number with 8 divisors.