The number 16095
16095 is a binary palindrome (11111011011111). Its prime factorisation is 3 × 5 × 29 × 37. Divisors (16): 1, 3, 5, 15, 29, 37, 87, 111, 145, 185, 435, 555, 1073, 3219, 5365, 16095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 16095: a binary palindrome (11111011011111).
- 2
16095 is composite. Its prime factorisation is
- 3
The divisors add up to 27360; without 16095 itself that is 11265, so 16095 is deficient (11265 is less than 16095). Euler's totient φ(16095) = 8064 numbers up to 16095 share no factor with it.
- 4
The digits of 16095 add up to 21, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 45 steps to reach 1.
LaTeX source of the formulas on this page
\[ 16095 = 3 \times 5 \times 29 \times 37 \]
16095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 27360 |
| Euler totient φ(n) | 8064 |
| Square | 259049025 |
| Cube | 4169394057375 |
| Square root | 126.866071 |
| Digit sum / digital root | 21 / 3 |
| Collatz steps to 1 | 45 |
| Scientific notation | 1.6095 × |
16095 in other forms
| Form | Value |
|---|---|
| In words | sixteen thousand and ninety-five |
| Binary (base 2) | 11111011011111 |
| Octal (base 8) | 37337 |
| Hexadecimal (base 16) | 3EDF |
| Base 3 | 211002010 |
| As time | 16095 seconds = 4 h 28 min 15 s |
Is 16095 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 (16095 ÷ 3 = 5365) | 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 (16095 ÷ 5 = 3219) | 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 2) | 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 3) | 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 2) | 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 16095 a prime number?
No. 16095 = 3 × 5 × 29 × 37, so it is divisible by 3.
What are the factors of 16095?
1, 3, 5, 15, 29, 37, 87, 111, 145, 185, 435, 555, 1073, 3219, 5365, 16095.
What is 16095 in binary?
11111011011111 (hexadecimal 3EDF, octal 37337).
What is the square root of 16095?
About 126.8661.
Is 16095 divisible by 3?
Yes. Its digits add up to 21, a multiple of 3.
What is special about the number 16095?
16095 is a binary palindrome (11111011011111).