The number 19493
19493 is a composite number with 4 divisors. Its prime factorisation is 101 × 193. Divisors (4): 1, 101, 193, 19493.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19493: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 101 × 193, the product of two primes.
- 2
19493 is composite. Its prime factorisation is
- 3
The divisors add up to 19788; without 19493 itself that is 295, so 19493 is deficient (295 is less than 19493). Euler's totient φ(19493) = 19200 numbers up to 19493 share no factor with it.
- 4
The digits of 19493 add up to 26, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 123 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19493 = 101 \times 193 \]
19493 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19788 |
| Euler totient φ(n) | 19200 |
| Square | 379977049 |
| Cube | 7406892616157 |
| Square root | 139.617334 |
| Digit sum / digital root | 26 / 8 |
| Collatz steps to 1 | 123 |
| Scientific notation | 1.9493 × |
19493 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand four hundred and ninety-three |
| Binary (base 2) | 100110000100101 |
| Octal (base 8) | 46045 |
| Hexadecimal (base 16) | 4C25 |
| Base 3 | 222201222 |
| As time | 19493 seconds = 5 h 24 min 53 s |
Is 19493 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 8) | 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 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 19493 a prime number?
No. 19493 = 101 × 193, so it is divisible by 101.
What are the factors of 19493?
1, 101, 193, 19493.
What is 19493 in binary?
100110000100101 (hexadecimal 4C25, octal 46045).
What is the square root of 19493?
About 139.6173.
Is 19493 divisible by 3?
No. Its digits add up to 26, which is not a multiple of 3.
What is special about the number 19493?
19493 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 101 × 193, the product of two primes.