The number 19693
19693 is a composite number with 4 divisors. Its prime factorisation is 47 × 419. Divisors (4): 1, 47, 419, 19693.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19693: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 419, the product of two primes.
- 2
19693 is composite. Its prime factorisation is
- 3
The divisors add up to 20160; without 19693 itself that is 467, so 19693 is deficient (467 is less than 19693). Euler's totient φ(19693) = 19228 numbers up to 19693 share no factor with it.
- 4
The digits of 19693 add up to 28, and repeating that until one digit is left gives the digital root 1. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19693 = 47 \times 419 \]
19693 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20160 |
| Euler totient φ(n) | 19228 |
| Square | 387814249 |
| Cube | 7637226005557 |
| Square root | 140.331750 |
| Digit sum / digital root | 28 / 1 |
| Collatz steps to 1 | 74 |
| Scientific notation | 1.9693 × |
19693 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand six hundred and ninety-three |
| Binary (base 2) | 100110011101101 |
| Octal (base 8) | 46355 |
| Hexadecimal (base 16) | 4CED |
| Base 3 | 1000000101 |
| As time | 19693 seconds = 5 h 28 min 13 s |
Is 19693 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 1) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 3) | 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 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 5) | 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 3) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 3) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19693 a prime number?
No. 19693 = 47 × 419, so it is divisible by 47.
What are the factors of 19693?
1, 47, 419, 19693.
What is 19693 in binary?
100110011101101 (hexadecimal 4CED, octal 46355).
What is the square root of 19693?
About 140.3317.
Is 19693 divisible by 3?
No. Its digits add up to 28, which is not a multiple of 3.
What is special about the number 19693?
19693 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 47 × 419, the product of two primes.