The number 19994
19994 is a composite number with 8 divisors. Its prime factorisation is 2 × 13 × 769. Divisors (8): 1, 2, 13, 26, 769, 1538, 9997, 19994.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19994 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19994 is composite. Its prime factorisation is
- 3
The divisors add up to 32340; without 19994 itself that is 12346, so 19994 is deficient (12346 is less than 19994). Euler's totient φ(19994) = 9216 numbers up to 19994 share no factor with it.
- 4
The digits of 19994 add up to 32, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 180 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19994 = 2 \times 13 \times 769 \]
19994 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 32340 |
| Euler totient φ(n) | 9216 |
| Square | 399760036 |
| Cube | 7992802159784 |
| Square root | 141.400141 |
| Digit sum / digital root | 32 / 5 |
| Collatz steps to 1 | 180 |
| Scientific notation | 1.9994 × |
19994 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand nine hundred and ninety-four |
| Binary (base 2) | 100111000011010 |
| Octal (base 8) | 47032 |
| Hexadecimal (base 16) | 4E1A |
| Base 3 | 1000102112 |
| As time | 19994 seconds = 5 h 33 min 14 s |
Is 19994 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19994 ÷ 2 = 9997) | A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8). |
| 3 | No (remainder 2) | A number is divisible by 3 if the digits add up to a multiple of 3. |
| 4 | No (remainder 2) | 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 2) | 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 2) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 5) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 4) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19994 a prime number?
No. 19994 = 2 × 13 × 769, so it is divisible by 2.
What are the factors of 19994?
1, 2, 13, 26, 769, 1538, 9997, 19994.
What is 19994 in binary?
100111000011010 (hexadecimal 4E1A, octal 47032).
What is the square root of 19994?
About 141.4001.
Is 19994 divisible by 3?
No. Its digits add up to 32, which is not a multiple of 3.
What is special about the number 19994?
It is a composite number with 8 divisors.