The number 11265
11265 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 751. Divisors (8): 1, 3, 5, 15, 751, 2253, 3755, 11265.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11265: a Harshad number: divisible by its digit sum 15.
- 2
11265 is composite. Its prime factorisation is
- 3
The divisors add up to 18048; without 11265 itself that is 6783, so 11265 is deficient (6783 is less than 11265). Euler's totient φ(11265) = 6000 numbers up to 11265 share no factor with it.
- 4
The digits of 11265 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 60 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11265 = 3 \times 5 \times 751 \]
11265 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 18048 |
| Euler totient φ(n) | 6000 |
| Square | 126900225 |
| Cube | 1429531034625 |
| Square root | 106.136704 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 60 |
| Scientific notation | 1.1265 × |
11265 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand two hundred and sixty-five |
| Binary (base 2) | 10110000000001 |
| Octal (base 8) | 26001 |
| Hexadecimal (base 16) | 2C01 |
| Base 3 | 120110020 |
| As time | 11265 seconds = 3 h 7 min 45 s |
Is 11265 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 (11265 ÷ 3 = 3755) | 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 (11265 ÷ 5 = 2253) | 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 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 1) | 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 5) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11265 a prime number?
No. 11265 = 3 × 5 × 751, so it is divisible by 3.
What are the factors of 11265?
1, 3, 5, 15, 751, 2253, 3755, 11265.
What is 11265 in binary?
10110000000001 (hexadecimal 2C01, octal 26001).
What is the square root of 11265?
About 106.1367.
Is 11265 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 11265?
11265 is a Harshad number: divisible by its digit sum 15.