The number 11573
11573 is a composite number with 4 divisors. Its prime factorisation is 71 × 163. Divisors (4): 1, 71, 163, 11573.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11573: a semiprime: 71 × 163, the product of two primes.
- 2
11573 is composite. Its prime factorisation is
- 3
The divisors add up to 11808; without 11573 itself that is 235, so 11573 is deficient (235 is less than 11573). Euler's totient φ(11573) = 11340 numbers up to 11573 share no factor with it.
- 4
The digits of 11573 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 50 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11573 = 71 \times 163 \]
11573 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 11808 |
| Euler totient φ(n) | 11340 |
| Square | 133934329 |
| Cube | 1550021989517 |
| Square root | 107.577879 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 50 |
| Scientific notation | 1.1573 × |
11573 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and seventy-three |
| Binary (base 2) | 10110100110101 |
| Octal (base 8) | 26465 |
| Hexadecimal (base 16) | 2D35 |
| Base 3 | 120212122 |
| As time | 11573 seconds = 3 h 12 min 53 s |
Is 11573 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 1) | 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 5) | 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 5) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11573 a prime number?
No. 11573 = 71 × 163, so it is divisible by 71.
What are the factors of 11573?
1, 71, 163, 11573.
What is 11573 in binary?
10110100110101 (hexadecimal 2D35, octal 26465).
What is the square root of 11573?
About 107.5779.
Is 11573 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11573?
11573 is a semiprime: 71 × 163, the product of two primes.