The number 20093
20093 is a composite number with 4 divisors. Its prime factorisation is 71 × 283. Divisors (4): 1, 71, 283, 20093.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20093: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 283, the product of two primes.
- 2
20093 is composite. Its prime factorisation is
- 3
The divisors add up to 20448; without 20093 itself that is 355, so 20093 is deficient (355 is less than 20093). Euler's totient φ(20093) = 19740 numbers up to 20093 share no factor with it.
- 4
The digits of 20093 add up to 14, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 92 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20093 = 71 \times 283 \]
20093 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20448 |
| Euler totient φ(n) | 19740 |
| Square | 403728649 |
| Cube | 8112119744357 |
| Square root | 141.749780 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 92 |
| Scientific notation | 2.0093 × |
20093 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and ninety-three |
| Binary (base 2) | 100111001111101 |
| Octal (base 8) | 47175 |
| Hexadecimal (base 16) | 4E7D |
| Base 3 | 1000120012 |
| As time | 20093 seconds = 5 h 34 min 53 s |
Is 20093 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 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 5) | 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 3) | 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 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20093 a prime number?
No. 20093 = 71 × 283, so it is divisible by 71.
What are the factors of 20093?
1, 71, 283, 20093.
What is 20093 in binary?
100111001111101 (hexadecimal 4E7D, octal 47175).
What is the square root of 20093?
About 141.7498.
Is 20093 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 20093?
20093 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 71 × 283, the product of two primes.