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