The number 20642
20642 is a composite number with 4 divisors. Its prime factorisation is 2 × 10321. Divisors (4): 1, 2, 10321, 20642.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20642: a semiprime: 2 × 10321, the product of two primes.
- 2
20642 is composite. Its prime factorisation is
- 3
The divisors add up to 30966; without 20642 itself that is 10324, so 20642 is deficient (10324 is less than 20642). Euler's totient φ(20642) = 10320 numbers up to 20642 share no factor with it.
- 4
The digits of 20642 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 149 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20642 = 2 \times 10321 \]
20642 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 30966 |
| Euler totient φ(n) | 10320 |
| Square | 426092164 |
| Cube | 8795394449288 |
| Square root | 143.673240 |
| Digit sum / digital root | 14 / 5 |
| Collatz steps to 1 | 149 |
| Scientific notation | 2.0642 × |
20642 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand six hundred and forty-two |
| Binary (base 2) | 101000010100010 |
| Octal (base 8) | 50242 |
| Hexadecimal (base 16) | 50A2 |
| Base 3 | 1001022112 |
| As time | 20642 seconds = 5 h 44 min 2 s |
Is 20642 divisible by 2 to 12?
| Divisor | Answer | Rule |
|---|---|---|
| 2 | Yes (20642 ÷ 2 = 10321) | 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 2) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 2) | A number is divisible by 5 if the last digit is 0 or 5. |
| 6 | No (remainder 2) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 6) | 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 2) | 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 2) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 2) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20642 a prime number?
No. 20642 = 2 × 10321, so it is divisible by 2.
What are the factors of 20642?
1, 2, 10321, 20642.
What is 20642 in binary?
101000010100010 (hexadecimal 50A2, octal 50242).
What is the square root of 20642?
About 143.6732.
Is 20642 divisible by 3?
No. Its digits add up to 14, which is not a multiple of 3.
What is special about the number 20642?
20642 is a semiprime: 2 × 10321, the product of two primes.