The number 20193
20193 is a composite number with 8 divisors. Its prime factorisation is 3 × 53 × 127. Divisors (8): 1, 3, 53, 127, 159, 381, 6731, 20193.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20193 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20193 is composite. Its prime factorisation is
- 3
The divisors add up to 27648; without 20193 itself that is 7455, so 20193 is deficient (7455 is less than 20193). Euler's totient φ(20193) = 13104 numbers up to 20193 share no factor with it.
- 4
The digits of 20193 add up to 15, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 167 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20193 = 3 \times 53 \times 127 \]
20193 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 27648 |
| Euler totient φ(n) | 13104 |
| Square | 407757249 |
| Cube | 8233842129057 |
| Square root | 142.102076 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 167 |
| Scientific notation | 2.0193 × |
20193 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and ninety-three |
| Binary (base 2) | 100111011100001 |
| Octal (base 8) | 47341 |
| Hexadecimal (base 16) | 4EE1 |
| Base 3 | 1000200220 |
| As time | 20193 seconds = 5 h 36 min 33 s |
Is 20193 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 | Yes (20193 ÷ 3 = 6731) | 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 3) | 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 1) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 6) | 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20193 a prime number?
No. 20193 = 3 × 53 × 127, so it is divisible by 3.
What are the factors of 20193?
1, 3, 53, 127, 159, 381, 6731, 20193.
What is 20193 in binary?
100111011100001 (hexadecimal 4EE1, octal 47341).
What is the square root of 20193?
About 142.1021.
Is 20193 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20193?
It is a composite number with 8 divisors.