The number 11460
11460 is a composite number with 24 divisors. Its prime factorisation is × 3 × 5 × 191. Divisors (24): 1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 191, 382, 573, 764 … 11460.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11460: a Harshad number: divisible by its digit sum 12.
- 2
11460 is composite. Its prime factorisation is
- 3
The divisors add up to 32256; without 11460 itself that is 20796, so 11460 is abundant (20796 is more than 11460). Euler's totient φ(11460) = 3040 numbers up to 11460 share no factor with it.
- 4
The digits of 11460 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 29 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11460 = 2^{2} \times 3 \times 5 \times 191 \]11460 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 24 |
| Sum of divisors | 32256 |
| Euler totient φ(n) | 3040 |
| Square | 131331600 |
| Cube | 1505060136000 |
| Square root | 107.051390 (= 2√2865) |
| Digit sum / digital root | 12 / 3 |
| Collatz steps to 1 | 29 |
| Scientific notation | 1.146 × |
11460 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty |
| Binary (base 2) | 10110011000100 |
| Octal (base 8) | 26304 |
| Hexadecimal (base 16) | 2CC4 |
| Base 3 | 120201110 |
| As time | 11460 seconds = 3 h 11 min 0 s |
Is 11460 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (11460 ÷ 2 = 5730) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | Yes (11460 ÷ 3 = 3820) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | Yes (11460 ÷ 4 = 2865) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11460 ÷ 5 = 2292) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | Yes (11460 ÷ 6 = 1910) | 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 4) | 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 | Yes (11460 ÷ 10 = 1146) | 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 | Yes (11460 ÷ 12 = 955) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11460 a prime number?
No. 11460 = × 3 × 5 × 191, so it is divisible by 2.
What are the factors of 11460?
1, 2, 3, 4, 5, 6, 10, 12, 15, 20, 30, 60, 191, 382, 573, 764, 955, 1146, 1910, 2292, 2865, 3820, 5730, 11460.
What is 11460 in binary?
10110011000100 (hexadecimal 2CC4, octal 26304).
What is the square root of 11460?
About 107.0514, exactly 2√2865.
Is 11460 divisible by 3?
Yes. Its digits add up to 12, a multiple of 3.
What is special about the number 11460?
11460 is a Harshad number: divisible by its digit sum 12.