The number 19995
19995 is a composite number with 16 divisors. Its prime factorisation is 3 × 5 × 31 × 43. Divisors (16): 1, 3, 5, 15, 31, 43, 93, 129, 155, 215, 465, 645, 1333, 3999, 6665, 19995.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19995 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19995 is composite. Its prime factorisation is
- 3
The divisors add up to 33792; without 19995 itself that is 13797, so 19995 is deficient (13797 is less than 19995). Euler's totient φ(19995) = 10080 numbers up to 19995 share no factor with it.
- 4
The digits of 19995 add up to 33, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19995 = 3 \times 5 \times 31 \times 43 \]
19995 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 16 |
| Sum of divisors | 33792 |
| Euler totient φ(n) | 10080 |
| Square | 399800025 |
| Cube | 7994001499875 |
| Square root | 141.403677 |
| Digit sum / digital root | 33 / 6 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.9995 × |
19995 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand nine hundred and ninety-five |
| Binary (base 2) | 100111000011011 |
| Octal (base 8) | 47033 |
| Hexadecimal (base 16) | 4E1B |
| Base 3 | 1000102120 |
| As time | 19995 seconds = 5 h 33 min 15 s |
Is 19995 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 (19995 ÷ 3 = 6665) | 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 (19995 ÷ 5 = 3999) | 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 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 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 8) | 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 19995 a prime number?
No. 19995 = 3 × 5 × 31 × 43, so it is divisible by 3.
What are the factors of 19995?
1, 3, 5, 15, 31, 43, 93, 129, 155, 215, 465, 645, 1333, 3999, 6665, 19995.
What is 19995 in binary?
100111000011011 (hexadecimal 4E1B, octal 47033).
What is the square root of 19995?
About 141.4037.
Is 19995 divisible by 3?
Yes. Its digits add up to 33, a multiple of 3.
What is special about the number 19995?
It is a composite number with 16 divisors.