The number 20913
20913 is a composite number with 4 divisors. Its prime factorisation is 3 × 6971. Divisors (4): 1, 3, 6971, 20913.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20913: a semiprime: 3 × 6971, the product of two primes.
- 2
20913 is composite. Its prime factorisation is
- 3
The divisors add up to 27888; without 20913 itself that is 6975, so 20913 is deficient (6975 is less than 20913). Euler's totient φ(20913) = 13940 numbers up to 20913 share no factor with it.
- 4
The digits of 20913 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 56 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20913 = 3 \times 6971 \]
20913 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27888 |
| Euler totient φ(n) | 13940 |
| Square | 437353569 |
| Cube | 9146375188497 |
| Square root | 144.613277 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 56 |
| Scientific notation | 2.0913 × |
20913 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand nine hundred and thirteen |
| Binary (base 2) | 101000110110001 |
| Octal (base 8) | 50661 |
| Hexadecimal (base 16) | 51B1 |
| Base 3 | 1001200120 |
| As time | 20913 seconds = 5 h 48 min 33 s |
Is 20913 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 (20913 ÷ 3 = 6971) | 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 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 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 2) | 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 20913 a prime number?
No. 20913 = 3 × 6971, so it is divisible by 3.
What are the factors of 20913?
1, 3, 6971, 20913.
What is 20913 in binary?
101000110110001 (hexadecimal 51B1, octal 50661).
What is the square root of 20913?
About 144.6133.
Is 20913 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20913?
20913 is a semiprime: 3 × 6971, the product of two primes.