The number 19694
19694 is a composite number with 8 divisors. Its prime factorisation is 2 × 43 × 229. Divisors (8): 1, 2, 43, 86, 229, 458, 9847, 19694.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
19694 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
19694 is composite. Its prime factorisation is
- 3
The divisors add up to 30360; without 19694 itself that is 10666, so 19694 is deficient (10666 is less than 19694). Euler's totient φ(19694) = 9576 numbers up to 19694 share no factor with it.
- 4
The digits of 19694 add up to 29, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19694 = 2 \times 43 \times 229 \]
19694 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 30360 |
| Euler totient φ(n) | 9576 |
| Square | 387853636 |
| Cube | 7638389507384 |
| Square root | 140.335313 |
| Digit sum / digital root | 29 / 2 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9694 × |
19694 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety-four |
| Binary (base 2) | 100110011101110 |
| Octal (base 8) | 46356 |
| Hexadecimal (base 16) | 4CEE |
| Base 3 | 1000000102 |
| As time | 19694 seconds = 5 h 28 min 14 s |
Is 19694 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (19694 ÷ 2 = 9847) | 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 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 6) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | 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 4) | 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 19694 a prime number?
No. 19694 = 2 × 43 × 229, so it is divisible by 2.
What are the factors of 19694?
1, 2, 43, 86, 229, 458, 9847, 19694.
What is 19694 in binary?
100110011101110 (hexadecimal 4CEE, octal 46356).
What is the square root of 19694?
About 140.3353.
Is 19694 divisible by 3?
No. Its digits add up to 29, which is not a multiple of 3.
What is special about the number 19694?
It is a composite number with 8 divisors.