The number 14395
14395 is a composite number with 4 divisors. Its prime factorisation is 5 × 2879. Divisors (4): 1, 5, 2879, 14395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 14395: a semiprime: 5 × 2879, the product of two primes.
- 2
14395 is composite. Its prime factorisation is
- 3
The divisors add up to 17280; without 14395 itself that is 2885, so 14395 is deficient (2885 is less than 14395). Euler's totient φ(14395) = 11512 numbers up to 14395 share no factor with it.
- 4
The digits of 14395 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 71 steps to reach 1.
LaTeX source of the formulas on this page
\[ 14395 = 5 \times 2879 \]
14395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 17280 |
| Euler totient φ(n) | 11512 |
| Square | 207216025 |
| Cube | 2982874679875 |
| Square root | 119.979165 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 71 |
| Scientific notation | 1.4395 × |
14395 in other forms
| Form | Value |
|---|---|
| In words | fourteen thousand three hundred and ninety-five |
| Binary (base 2) | 11100000111011 |
| Octal (base 8) | 34073 |
| Hexadecimal (base 16) | 383B |
| Base 3 | 201202011 |
| As time | 14395 seconds = 3 h 59 min 55 s |
Is 14395 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 (14395 ÷ 5 = 2879) | 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 3) | 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 4) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 14395 a prime number?
No. 14395 = 5 × 2879, so it is divisible by 5.
What are the factors of 14395?
1, 5, 2879, 14395.
What is 14395 in binary?
11100000111011 (hexadecimal 383B, octal 34073).
What is the square root of 14395?
About 119.9792.
Is 14395 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 14395?
14395 is a semiprime: 5 × 2879, the product of two primes.