The number 11570
11570 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 13 × 89. Divisors (16): 1, 2, 5, 10, 13, 26, 65, 89, 130, 178, 445, 890, 1157, 2314, 5785, 11570.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11570 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11570 is composite. Its prime factorisation is
- 3
The divisors add up to 22680; without 11570 itself that is 11110, so 11570 is deficient (11110 is less than 11570). Euler's totient φ(11570) = 4224 numbers up to 11570 share no factor with it.
- 4
The digits of 11570 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 81 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11570 = 2 \times 5 \times 13 \times 89 \]
11570 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 22680 |
| Euler totient φ(n) | 4224 |
| Square | 133864900 |
| Cube | 1548816893000 |
| Square root | 107.563934 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 81 |
| Scientific notation | 1.157 × |
11570 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and seventy |
| Binary (base 2) | 10110100110010 |
| Octal (base 8) | 26462 |
| Hexadecimal (base 16) | 2D32 |
| Base 3 | 120212112 |
| As time | 11570 seconds = 3 h 12 min 50 s |
Is 11570 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11570 ÷ 2 = 5785) | 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 | Yes (11570 ÷ 5 = 2314) | 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 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | Yes (11570 ÷ 10 = 1157) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | 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 11570 a prime number?
No. 11570 = 2 × 5 × 13 × 89, so it is divisible by 2.
What are the factors of 11570?
1, 2, 5, 10, 13, 26, 65, 89, 130, 178, 445, 890, 1157, 2314, 5785, 11570.
What is 11570 in binary?
10110100110010 (hexadecimal 2D32, octal 26462).
What is the square root of 11570?
About 107.5639.
Is 11570 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 11570?
It is a composite number with 16 divisors.