The number 20031
20031 is a composite number with 8 divisors. Its prime factorisation is 3 × 11 × 607. Divisors (8): 1, 3, 11, 33, 607, 1821, 6677, 20031.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
20031 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.
- 2
20031 is composite. Its prime factorisation is
- 3
The divisors add up to 29184; without 20031 itself that is 9153, so 20031 is deficient (9153 is less than 20031). Euler's totient φ(20031) = 12120 numbers up to 20031 share no factor with it.
- 4
The digits of 20031 add up to 6, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 66 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20031 = 3 \times 11 \times 607 \]
20031 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 8 |
| Sum of divisors | 29184 |
| Euler totient φ(n) | 12120 |
| Square | 401240961 |
| Cube | 8037257689791 |
| Square root | 141.530915 |
| Digit sum / digital root | 6 / 6 |
| Collatz steps to 1 | 66 |
| Scientific notation | 2.0031 × |
20031 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand and thirty-one |
| Binary (base 2) | 100111000111111 |
| Octal (base 8) | 47077 |
| Hexadecimal (base 16) | 4E3F |
| Base 3 | 1000110220 |
| As time | 20031 seconds = 5 h 33 min 51 s |
Is 20031 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 (20031 ÷ 3 = 6677) | 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 4) | 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 | Yes (20031 ÷ 11 = 1821) | 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 20031 a prime number?
No. 20031 = 3 × 11 × 607, so it is divisible by 3.
What are the factors of 20031?
1, 3, 11, 33, 607, 1821, 6677, 20031.
What is 20031 in binary?
100111000111111 (hexadecimal 4E3F, octal 47077).
What is the square root of 20031?
About 141.5309.
Is 20031 divisible by 3?
Yes. Its digits add up to 6, a multiple of 3.
What is special about the number 20031?
It is a composite number with 8 divisors.