The number 20579
20579 is a composite number with 4 divisors. Its prime factorisation is 13 × 1583. Divisors (4): 1, 13, 1583, 20579.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20579: a semiprime: 13 × 1583, the product of two primes.
- 2
20579 is composite. Its prime factorisation is
- 3
The divisors add up to 22176; without 20579 itself that is 1597, so 20579 is deficient (1597 is less than 20579). Euler's totient φ(20579) = 18984 numbers up to 20579 share no factor with it.
- 4
The digits of 20579 add up to 23, and repeating that until one digit is left gives the digital root 5. The Collatz sequence (halve if even, else 3n+1) takes 61 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20579 = 13 \times 1583 \]
20579 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 22176 |
| Euler totient φ(n) | 18984 |
| Square | 423495241 |
| Cube | 8715108564539 |
| Square root | 143.453825 |
| Digit sum / digital root | 23 / 5 |
| Collatz steps to 1 | 61 |
| Scientific notation | 2.0579 × |
20579 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and seventy-nine |
| Binary (base 2) | 101000001100011 |
| Octal (base 8) | 50143 |
| Hexadecimal (base 16) | 5063 |
| Base 3 | 1001020012 |
| As time | 20579 seconds = 5 h 42 min 59 s |
Is 20579 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 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 3) | 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 9) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 9) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20579 a prime number?
No. 20579 = 13 × 1583, so it is divisible by 13.
What are the factors of 20579?
1, 13, 1583, 20579.
What is 20579 in binary?
101000001100011 (hexadecimal 5063, octal 50143).
What is the square root of 20579?
About 143.4538.
Is 20579 divisible by 3?
No. Its digits add up to 23, which is not a multiple of 3.
What is special about the number 20579?
20579 is a semiprime: 13 × 1583, the product of two primes.