The number 20095
20095 is a composite number with 4 divisors. Its prime factorisation is 5 × 4019. Divisors (4): 1, 5, 4019, 20095.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20095: a semiprime: 5 × 4019, the product of two primes.
- 2
20095 is composite. Its prime factorisation is
- 3
The divisors add up to 24120; without 20095 itself that is 4025, so 20095 is deficient (4025 is less than 20095). Euler's totient φ(20095) = 16072 numbers up to 20095 share no factor with it.
- 4
The digits of 20095 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 242 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20095 = 5 \times 4019 \]
20095 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 24120 |
| Euler totient φ(n) | 16072 |
| Square | 403809025 |
| Cube | 8114542357375 |
| Square root | 141.756834 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 242 |
| Scientific notation | 2.0095 × |
20095 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-five |
| Binary (base 2) | 100111001111111 |
| Octal (base 8) | 47177 |
| Hexadecimal (base 16) | 4E7F |
| Base 3 | 1000120021 |
| As time | 20095 seconds = 5 h 34 min 55 s |
Is 20095 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 (20095 ÷ 5 = 4019) | 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 5) | 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 7) | 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 9) | 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 20095 a prime number?
No. 20095 = 5 × 4019, so it is divisible by 5.
What are the factors of 20095?
1, 5, 4019, 20095.
What is 20095 in binary?
100111001111111 (hexadecimal 4E7F, octal 47177).
What is the square root of 20095?
About 141.7568.
Is 20095 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 20095?
20095 is a semiprime: 5 × 4019, the product of two primes.