The number 11558
11558 is a composite number with 4 divisors. Its prime factorisation is 2 × 5779. Divisors (4): 1, 2, 5779, 11558.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11558: a semiprime: 2 × 5779, the product of two primes.
- 2
11558 is composite. Its prime factorisation is
- 3
The divisors add up to 17340; without 11558 itself that is 5782, so 11558 is deficient (5782 is less than 11558). Euler's totient φ(11558) = 5778 numbers up to 11558 share no factor with it.
- 4
The digits of 11558 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11558 = 2 \times 5779 \]
11558 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17340 |
| Euler totient φ(n) | 5778 |
| Square | 133587364 |
| Cube | 1544002753112 |
| Square root | 107.508139 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1558 × |
11558 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and fifty-eight |
| Binary (base 2) | 10110100100110 |
| Octal (base 8) | 26446 |
| Hexadecimal (base 16) | 2D26 |
| Base 3 | 120212002 |
| As time | 11558 seconds = 3 h 12 min 38 s |
Is 11558 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11558 ÷ 2 = 5779) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 1) | 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 8) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 8) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11558 a prime number?
No. 11558 = 2 × 5779, so it is divisible by 2.
What are the factors of 11558?
1, 2, 5779, 11558.
What is 11558 in binary?
10110100100110 (hexadecimal 2D26, octal 26446).
What is the square root of 11558?
About 107.5081.
Is 11558 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 11558?
11558 is a semiprime: 2 × 5779, the product of two primes.