The number 20571
20571 is a composite number with 4 divisors. Its prime factorisation is 3 × 6857. Divisors (4): 1, 3, 6857, 20571.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20571: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6857, the product of two primes.
- 2
20571 is composite. Its prime factorisation is
- 3
The divisors add up to 27432; without 20571 itself that is 6861, so 20571 is deficient (6861 is less than 20571). Euler's totient φ(20571) = 13712 numbers up to 20571 share no factor with it.
- 4
The digits of 20571 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 141 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20571 = 3 \times 6857 \]
20571 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 27432 |
| Euler totient φ(n) | 13712 |
| Square | 423166041 |
| Cube | 8704948629411 |
| Square root | 143.425939 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 141 |
| Scientific notation | 2.0571 × |
20571 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and seventy-one |
| Binary (base 2) | 101000001011011 |
| Octal (base 8) | 50133 |
| Hexadecimal (base 16) | 505B |
| Base 3 | 1001012220 |
| As time | 20571 seconds = 5 h 42 min 51 s |
Is 20571 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 (20571 ÷ 3 = 6857) | 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 1) | 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 3) | 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 1) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 1) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 3) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20571 a prime number?
No. 20571 = 3 × 6857, so it is divisible by 3.
What are the factors of 20571?
1, 3, 6857, 20571.
What is 20571 in binary?
101000001011011 (hexadecimal 505B, octal 50133).
What is the square root of 20571?
About 143.4259.
Is 20571 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20571?
20571 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6857, the product of two primes.