The number 11465
11465 is a composite number with 4 divisors. Its prime factorisation is 5 × 2293. Divisors (4): 1, 5, 2293, 11465.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11465: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 2293, the product of two primes.
- 2
11465 is composite. Its prime factorisation is
- 3
The divisors add up to 13764; without 11465 itself that is 2299, so 11465 is deficient (2299 is less than 11465). Euler's totient φ(11465) = 9168 numbers up to 11465 share no factor with it.
- 4
The digits of 11465 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11465 = 5 \times 2293 \]
11465 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 13764 |
| Euler totient φ(n) | 9168 |
| Square | 131446225 |
| Cube | 1507030969625 |
| Square root | 107.074740 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1465 × |
11465 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and sixty-five |
| Binary (base 2) | 10110011001001 |
| Octal (base 8) | 26311 |
| Hexadecimal (base 16) | 2CC9 |
| Base 3 | 120201122 |
| As time | 11465 seconds = 3 h 11 min 5 s |
Is 11465 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 | No (remainder 2) | 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 (11465 ÷ 5 = 2293) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 5) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 8) | 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 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11465 a prime number?
No. 11465 = 5 × 2293, so it is divisible by 5.
What are the factors of 11465?
1, 5, 2293, 11465.
What is 11465 in binary?
10110011001001 (hexadecimal 2CC9, octal 26311).
What is the square root of 11465?
About 107.0747.
Is 11465 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11465?
11465 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 5 × 2293, the product of two primes.