The number 20137
20137 is a composite number with 4 divisors. Its prime factorisation is 13 × 1549. Divisors (4): 1, 13, 1549, 20137.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20137: a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1549, the product of two primes.
- 2
20137 is composite. Its prime factorisation is
- 3
The divisors add up to 21700; without 20137 itself that is 1563, so 20137 is deficient (1563 is less than 20137). Euler's totient φ(20137) = 18576 numbers up to 20137 share no factor with it.
- 4
The digits of 20137 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 118 steps to reach 1.
LaTeX source of the formulas on this page
\[ 20137 = 13 \times 1549 \]
20137 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 21700 |
| Euler totient φ(n) | 18576 |
| Square | 405498769 |
| Cube | 8165528711353 |
| Square root | 141.904898 |
| Digit sum / digital root | 13 / 4 |
| Collatz steps to 1 | 118 |
| Scientific notation | 2.0137 × |
20137 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and thirty-seven |
| Binary (base 2) | 100111010101001 |
| Octal (base 8) | 47251 |
| Hexadecimal (base 16) | 4EA9 |
| Base 3 | 1000121211 |
| As time | 20137 seconds = 5 h 35 min 37 s |
Is 20137 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 1) | 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 1) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | No (remainder 5) | 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 1) | 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 7) | A number is divisible by 10 if the last digit is 0. |
| 11 | No (remainder 7) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 1) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20137 a prime number?
No. 20137 = 13 × 1549, so it is divisible by 13.
What are the factors of 20137?
1, 13, 1549, 20137.
What is 20137 in binary?
100111010101001 (hexadecimal 4EA9, octal 47251).
What is the square root of 20137?
About 141.9049.
Is 20137 divisible by 3?
No. Its digits add up to 13, which is not a multiple of 3.
What is special about the number 20137?
20137 is a Harshad number: divisible by its digit sum 13; a semiprime: 13 × 1549, the product of two primes.