The number 20267
20267 is a composite number with 4 divisors. Its prime factorisation is 13 × 1559. Divisors (4): 1, 13, 1559, 20267.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20267: a semiprime: 13 × 1559, the product of two primes.
- 2
20267 is composite. Its prime factorisation is
- 3
The divisors add up to 21840; without 20267 itself that is 1573, so 20267 is deficient (1573 is less than 20267). Euler's totient φ(20267) = 18696 numbers up to 20267 share no factor with it.
- 4
The digits of 20267 add up to 17, and repeating that until one digit is left gives the digital root 8. The Collatz sequence (halve if even, else 3n+1) takes 74 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20267 = 13 \times 1559 \]
20267 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21840 |
| Euler totient φ(n) | 18696 |
| Square | 410751289 |
| Cube | 8324696374163 |
| Square root | 142.362214 |
| Digit sum / digital root | 17 / 8 |
| Collatz steps to 1 | 74 |
| Scientific notation | 2.0267 × |
20267 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand two hundred and sixty-seven |
| Binary (base 2) | 100111100101011 |
| Octal (base 8) | 47453 |
| Hexadecimal (base 16) | 4F2B |
| Base 3 | 1000210122 |
| As time | 20267 seconds = 5 h 37 min 47 s |
Is 20267 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 2) | 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 8) | 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 5) | 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 20267 a prime number?
No. 20267 = 13 × 1559, so it is divisible by 13.
What are the factors of 20267?
1, 13, 1559, 20267.
What is 20267 in binary?
100111100101011 (hexadecimal 4F2B, octal 47453).
What is the square root of 20267?
About 142.3622.
Is 20267 divisible by 3?
No. Its digits add up to 17, which is not a multiple of 3.
What is special about the number 20267?
20267 is a semiprime: 13 × 1559, the product of two primes.