The number 11505
11505 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 13 × 59. Divisors (16): 1, 3, 5, 13, 15, 39, 59, 65, 177, 195, 295, 767, 885, 2301, 3835, 11505.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11505 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11505 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 11505 itself that is 8655, so 11505 is deficient (8655 is less than 11505). Euler's totient φ(11505) = 5568 numbers up to 11505 share no factor with it.
- 4
The digits of 11505 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 55 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11505 = 3 \times 5 \times 13 \times 59 \]
11505 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 5568 |
| Square | 132365025 |
| Cube | 1522859612625 |
| Square root | 107.261363 |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 55 |
| Scientific notation | 1.1505 × |
11505 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand five hundred and five |
| Binary (base 2) | 10110011110001 |
| Octal (base 8) | 26361 |
| Hexadecimal (base 16) | 2CF1 |
| Base 3 | 120210010 |
| As time | 11505 seconds = 3 h 11 min 45 s |
Is 11505 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 (11505 ÷ 3 = 3835) | 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 | Yes (11505 ÷ 5 = 2301) | 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 | No (remainder 4) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 3) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11505 a prime number?
No. 11505 = 3 × 5 × 13 × 59, so it is divisible by 3.
What are the factors of 11505?
1, 3, 5, 13, 15, 39, 59, 65, 177, 195, 295, 767, 885, 2301, 3835, 11505.
What is 11505 in binary?
10110011110001 (hexadecimal 2CF1, octal 26361).
What is the square root of 11505?
About 107.2614.
Is 11505 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11505?
It is a composite number with 16 divisors.