The number 20941
20941 is a composite number with 4 divisors. Its prime factorisation is 43 × 487. Divisors (4): 1, 43, 487, 20941.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20941: a semiprime: 43 × 487, the product of two primes.
- 2
20941 is composite. Its prime factorisation is
- 3
The divisors add up to 21472; without 20941 itself that is 531, so 20941 is deficient (531 is less than 20941). Euler's totient φ(20941) = 20412 numbers up to 20941 share no factor with it.
- 4
The digits of 20941 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20941 = 43 \times 487 \]
20941 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21472 |
| Euler totient φ(n) | 20412 |
| Square | 438525481 |
| Cube | 9183162097621 |
| Square root | 144.710055 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0941 × |
20941 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and forty-one |
| Binary (base 2) | 101000111001101 |
| Octal (base 8) | 50715 |
| Hexadecimal (base 16) | 51CD |
| Base 3 | 1001201121 |
| As time | 20941 seconds = 5 h 49 min 1 s |
Is 20941 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 1) | 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 7) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 1) | 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 20941 a prime number?
No. 20941 = 43 × 487, so it is divisible by 43.
What are the factors of 20941?
1, 43, 487, 20941.
What is 20941 in binary?
101000111001101 (hexadecimal 51CD, octal 50715).
What is the square root of 20941?
About 144.7101.
Is 20941 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 20941?
20941 is a semiprime: 43 × 487, the product of two primes.