The number 20567
20567 is a composite number with 4 divisors. Its prime factorisation is 131 × 157. Divisors (4): 1, 131, 157, 20567.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20567: a semiprime: 131 × 157, the product of two primes.
- 2
20567 is composite. Its prime factorisation is
- 3
The divisors add up to 20856; without 20567 itself that is 289, so 20567 is deficient (289 is less than 20567). Euler's totient φ(20567) = 20280 numbers up to 20567 share no factor with it.
- 4
The digits of 20567 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 87 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20567 = 131 \times 157 \]
20567 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 20856 |
| Euler totient φ(n) | 20280 |
| Square | 423001489 |
| Cube | 8699871624263 |
| Square root | 143.411994 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 87 |
| Scientific notation | 2.0567 × |
20567 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand five hundred and sixty-seven |
| Binary (base 2) | 101000001010111 |
| Octal (base 8) | 50127 |
| Hexadecimal (base 16) | 5057 |
| Base 3 | 1001012202 |
| As time | 20567 seconds = 5 h 42 min 47 s |
Is 20567 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 2) | 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 2) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 7) | 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 11) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20567 a prime number?
No. 20567 = 131 × 157, so it is divisible by 131.
What are the factors of 20567?
1, 131, 157, 20567.
What is 20567 in binary?
101000001010111 (hexadecimal 5057, octal 50127).
What is the square root of 20567?
About 143.4120.
Is 20567 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 20567?
20567 is a semiprime: 131 × 157, the product of two primes.