The number 11395
11395 is a composite number with 8 divisors. Its prime factorisation is 5 × 43 × 53. Divisors (8): 1, 5, 43, 53, 215, 265, 2279, 11395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
11395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
11395 is composite. Its prime factorisation is
- 3
The divisors add up to 14256; without 11395 itself that is 2861, so 11395 is deficient (2861 is less than 11395). Euler's totient φ(11395) = 8736 numbers up to 11395 share no factor with it.
- 4
The digits of 11395 add up to 19, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 68 steps to reach 1.
LaTeX source of the formulas on this page
\[ 11395 = 5 \times 43 \times 53 \]
11395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 14256 |
| Euler totient φ(n) | 8736 |
| Square | 129846025 |
| Cube | 1479595454875 |
| Square root | 106.747365 |
| Digit sum / digital root | 19 / 1 |
| Collatz steps to 1 | 68 |
| Scientific notation | 1.1395 × |
11395 in other forms
| Form | Value |
|---|---|
| In words | eleven thousand three hundred and ninety-five |
| Binary (base 2) | 10110010000011 |
| Octal (base 8) | 26203 |
| Hexadecimal (base 16) | 2C83 |
| Base 3 | 120122001 |
| As time | 11395 seconds = 3 h 9 min 55 s |
Is 11395 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 1) | 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 (11395 ÷ 5 = 2279) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 1) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 1) | 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 10) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 11395 a prime number?
No. 11395 = 5 × 43 × 53, so it is divisible by 5.
What are the factors of 11395?
1, 5, 43, 53, 215, 265, 2279, 11395.
What is 11395 in binary?
10110010000011 (hexadecimal 2C83, octal 26203).
What is the square root of 11395?
About 106.7474.
Is 11395 divisible by 3?
No. Its digits add up to 19, which is not a multiple of 3.
What is special about the number 11395?
It is a composite number with 8 divisors.