The number 19093
19093 is a composite number with 4 divisors. Its prime factorisation is 61 × 313. Divisors (4): 1, 61, 313, 19093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 19093: a semiprime: 61 × 313, the product of two primes.
- 2
19093 is composite. Its prime factorisation is
- 3
The divisors add up to 19468; without 19093 itself that is 375, so 19093 is deficient (375 is less than 19093). Euler's totient φ(19093) = 18720 numbers up to 19093 share no factor with it.
- 4
The digits of 19093 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 105 steps to reach 1.
LaTeX source of the formulas on this page
\[ 19093 = 61 \times 313 \]
19093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 19468 |
| Euler totient φ(n) | 18720 |
| Square | 364542649 |
| Cube | 6960212797357 |
| Square root | 138.177422 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 105 |
| Scientific notation | 1.9093 × |
19093 in other forms
| Form | Value |
|---|---|
| In words | nineteen thousand and ninety-three |
| Binary (base 2) | 100101010010101 |
| Octal (base 8) | 45225 |
| Hexadecimal (base 16) | 4A95 |
| Base 3 | 222012011 |
| As time | 19093 seconds = 5 h 18 min 13 s |
Is 19093 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 4) | 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 4) | 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 8) | 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 19093 a prime number?
No. 19093 = 61 × 313, so it is divisible by 61.
What are the factors of 19093?
1, 61, 313, 19093.
What is 19093 in binary?
100101010010101 (hexadecimal 4A95, octal 45225).
What is the square root of 19093?
About 138.1774.
Is 19093 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 19093?
19093 is a semiprime: 61 × 313, the product of two primes.