The number 20391
20391 is a composite number with 8 divisors. Its prime factorisation is 3 × 7 × 971. Divisors (8): 1, 3, 7, 21, 971, 2913, 6797, 20391.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20391 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20391 is composite. Its prime factorisation is
- 3
The divisors add up to 31104; without 20391 itself that is 10713, so 20391 is deficient (10713 is less than 20391). Euler's totient φ(20391) = 11640 numbers up to 20391 share no factor with it.
- 4
The digits of 20391 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 136 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20391 = 3 \times 7 \times 971 \]
20391 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 31104 |
| Euler totient φ(n) | 11640 |
| Square | 415792881 |
| Cube | 8478432636471 |
| Square root | 142.797059 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0391 × |
20391 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand three hundred and ninety-one |
| Binary (base 2) | 100111110100111 |
| Octal (base 8) | 47647 |
| Hexadecimal (base 16) | 4FA7 |
| Base 3 | 1000222020 |
| As time | 20391 seconds = 5 h 39 min 51 s |
Is 20391 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 (20391 ÷ 3 = 6797) | 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 | Yes (20391 ÷ 7 = 2913) | 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 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 8) | 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 20391 a prime number?
No. 20391 = 3 × 7 × 971, so it is divisible by 3.
What are the factors of 20391?
1, 3, 7, 21, 971, 2913, 6797, 20391.
What is 20391 in binary?
100111110100111 (hexadecimal 4FA7, octal 47647).
What is the square root of 20391?
About 142.7971.
Is 20391 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20391?
It is a composite number with 8 divisors.