The number 19999
19999 is a composite number with 4 divisors. Its prime factorisation is 7 × 2857. Divisors (4): 1, 7, 2857, 19999.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19999: a semiprime: 7 × 2857, the product of two primes.
- 2
19999 is composite. Its prime factorisation is
- 3
The divisors add up to 22864; without 19999 itself that is 2865, so 19999 is deficient (2865 is less than 19999). Euler's totient φ(19999) = 17136 numbers up to 19999 share no factor with it.
- 4
The digits of 19999 add up to 37, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19999 = 7 \times 2857 \]
19999 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22864 |
| Euler totient φ(n) | 17136 |
| Square | 399960001 |
| Cube | 7998800059999 |
| Square root | 141.417821 |
| Digit sum / digital root | 37 / 1 |
| Collatz steps to 1 | 66 |
| Scientific notation | 1.9999 × |
19999 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand nine hundred and ninety-nine |
| Binary (base 2) | 100111000011111 |
| Octal (base 8) | 47037 |
| Hexadecimal (base 16) | 4E1F |
| Base 3 | 1000102201 |
| As time | 19999 seconds = 5 h 33 min 19 s |
Is 19999 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 | No (remainder 4) | 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 | Yes (19999 ÷ 7 = 2857) | 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 1) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | 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 19999 a prime number?
No. 19999 = 7 × 2857, so it is divisible by 7.
What are the factors of 19999?
1, 7, 2857, 19999.
What is 19999 in binary?
100111000011111 (hexadecimal 4E1F, octal 47037).
What is the square root of 19999?
About 141.4178.
Is 19999 divisible by 3?
No. Its digits add up to 37, which is not a multiple of 3.
What is special about the number 19999?
19999 is a semiprime: 7 × 2857, the product of two primes.