The number 11495
11495 is a composite number with 12 divisors. Its prime factorisation is 5 × × 19. Divisors (12): 1, 5, 11, 19, 55, 95, 121, 209, 605, 1045, 2299, 11495.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11495 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11495 is composite. Its prime factorisation is
- 3
The divisors add up to 15960; without 11495 itself that is 4465, so 11495 is deficient (4465 is less than 11495). Euler's totient φ(11495) = 7920 numbers up to 11495 share no factor with it.
- 4
The digits of 11495 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 86 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11495 = 5 \times 11^{2} \times 19 \]11495 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 12 |
| Sum of divisors | 15960 |
| Euler totient φ(n) | 7920 |
| Square | 132135025 |
| Cube | 1518892112375 |
| Square root | 107.214738 (= 11√95) |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 86 |
| Scientific notation | 1.1495 × |
11495 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand four hundred and ninety-five |
| Binary (base 2) | 10110011100111 |
| Octal (base 8) | 26347 |
| Hexadecimal (base 16) | 2CE7 |
| Base 3 | 120202202 |
| As time | 11495 seconds = 3 h 11 min 35 s |
Is 11495 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | Yes (11495 ÷ 5 = 2299) | 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 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 | Yes (11495 ÷ 11 = 1045) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11495 a prime number?
No. 11495 = 5 × × 19, so it is divisible by 5.
What are the factors of 11495?
1, 5, 11, 19, 55, 95, 121, 209, 605, 1045, 2299, 11495.
What is 11495 in binary?
10110011100111 (hexadecimal 2CE7, octal 26347).
What is the square root of 11495?
About 107.2147, exactly 11√95.
Is 11495 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 11495?
It is a composite number with 12 divisors.