The number 16395
16395 is a composite number with 8 divisors. Its prime factorisation is 3 × 5 × 1093. Divisors (8): 1, 3, 5, 15, 1093, 3279, 5465, 16395.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
16395 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
16395 is composite. Its prime factorisation is
- 3
The divisors add up to 26256; without 16395 itself that is 9861, so 16395 is deficient (9861 is less than 16395). Euler's totient φ(16395) = 8736 numbers up to 16395 share no factor with it.
- 4
The digits of 16395 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 115 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16395 = 3 \times 5 \times 1093 \]
16395 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 26256 |
| Euler totient φ(n) | 8736 |
| Square | 268796025 |
| Cube | 4406910829875 |
| Square root | 128.042962 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 115 |
| Scientific notation | 1.6395 × |
16395 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand three hundred and ninety-five |
| Binary (base 2) | 100000000001011 |
| Octal (base 8) | 40013 |
| Hexadecimal (base 16) | 400B |
| Base 3 | 211111020 |
| As time | 16395 seconds = 4 h 33 min 15 s |
Is 16395 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 | Yes (16395 ÷ 3 = 5465) | 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 (16395 ÷ 5 = 3279) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 3) | 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 3) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 5) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 16395 a prime number?
No. 16395 = 3 × 5 × 1093, so it is divisible by 3.
What are the factors of 16395?
1, 3, 5, 15, 1093, 3279, 5465, 16395.
What is 16395 in binary?
100000000001011 (hexadecimal 400B, octal 40013).
What is the square root of 16395?
About 128.0430.
Is 16395 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 16395?
It is a composite number with 8 divisors.