The number 11571
11571 is a composite number with 16 divisors. Its prime factorisation is 3 × 7 × 19 × 29. Divisors (16): 1, 3, 7, 19, 21, 29, 57, 87, 133, 203, 399, 551, 609, 1653, 3857, 11571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11571 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11571 is composite. Its prime factorisation is
- 3
The divisors add up to 19200; without 11571 itself that is 7629, so 11571 is deficient (7629 is less than 11571). Euler's totient φ(11571) = 6048 numbers up to 11571 share no factor with it.
- 4
The digits of 11571 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 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11571 = 3 \times 7 \times 19 \times 29 \]
11571 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 19200 |
| Euler totient φ(n) | 6048 |
| Square | 133888041 |
| Cube | 1549218522411 |
| Square root | 107.568583 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.1571 × |
11571 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and seventy-one |
| Binary (base 2) | 10110100110011 |
| Octal (base 8) | 26463 |
| Hexadecimal (base 16) | 2D33 |
| Base 3 | 120212120 |
| As time | 11571 seconds = 3 h 12 min 51 s |
Is 11571 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 (11571 ÷ 3 = 3857) | 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 1) | 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 | Yes (11571 ÷ 7 = 1653) | 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 6) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11571 a prime number?
No. 11571 = 3 × 7 × 19 × 29, so it is divisible by 3.
What are the factors of 11571?
1, 3, 7, 19, 21, 29, 57, 87, 133, 203, 399, 551, 609, 1653, 3857, 11571.
What is 11571 in binary?
10110100110011 (hexadecimal 2D33, octal 26463).
What is the square root of 11571?
About 107.5686.
Is 11571 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11571?
It is a composite number with 16 divisors.