The number 11645
11645 is a composite number with 8 divisors. Its prime factorisation is 5 × 17 × 137. Divisors (8): 1, 5, 17, 85, 137, 685, 2329, 11645.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 11645: a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.
- 2
11645 is composite. Its prime factorisation is
- 3
The divisors add up to 14904; without 11645 itself that is 3259, so 11645 is deficient (3259 is less than 11645). Euler's totient φ(11645) = 8704 numbers up to 11645 share no factor with it.
- 4
The digits of 11645 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 143 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11645 = 5 \times 17 \times 137 \]
11645 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14904 |
| Euler totient φ(n) | 8704 |
| Square | 135606025 |
| Cube | 1579132161125 |
| Square root | 107.912001 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 143 |
| Scientific notation | 1.1645 × |
11645 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand six hundred and forty-five |
| Binary (base 2) | 10110101111101 |
| Octal (base 8) | 26575 |
| Hexadecimal (base 16) | 2D7D |
| Base 3 | 120222022 |
| As time | 11645 seconds = 3 h 14 min 5 s |
Is 11645 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 (11645 ÷ 5 = 2329) | 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 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 5) | 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 7) | 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 11645 a prime number?
No. 11645 = 5 × 17 × 137, so it is divisible by 5.
What are the factors of 11645?
1, 5, 17, 85, 137, 685, 2329, 11645.
What is 11645 in binary?
10110101111101 (hexadecimal 2D7D, octal 26575).
What is the square root of 11645?
About 107.9120.
Is 11645 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 11645?
11645 is a happy number: repeatedly adding the squares of its digits reaches 1; a Harshad number: divisible by its digit sum 17.