The number 20157
20157 is a composite number with 4 divisors. Its prime factorisation is 3 × 6719. Divisors (4): 1, 3, 6719, 20157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 20157: a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6719, the product of two primes.
- 2
20157 is composite. Its prime factorisation is
- 3
The divisors add up to 26880; without 20157 itself that is 6723, so 20157 is deficient (6723 is less than 20157). Euler's totient φ(20157) = 13436 numbers up to 20157 share no factor with it.
- 4
The digits of 20157 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
\[ 20157 = 3 \times 6719 \]
20157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 26880 |
| Euler totient φ(n) | 13436 |
| Square | 406304649 |
| Cube | 8189882809893 |
| Square root | 141.975350 |
| Digit sum / digital root | 15 / 6 |
| Collatz steps to 1 | 136 |
| Scientific notation | 2.0157 × |
20157 in other forms
| Form | Value |
|---|---|
| In words | twenty thousand one hundred and fifty-seven |
| Binary (base 2) | 100111010111101 |
| Octal (base 8) | 47275 |
| Hexadecimal (base 16) | 4EBD |
| Base 3 | 1000122120 |
| As time | 20157 seconds = 5 h 35 min 57 s |
Is 20157 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 (20157 ÷ 3 = 6719) | 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 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 5) | 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 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 9) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 20157 a prime number?
No. 20157 = 3 × 6719, so it is divisible by 3.
What are the factors of 20157?
1, 3, 6719, 20157.
What is 20157 in binary?
100111010111101 (hexadecimal 4EBD, octal 47275).
What is the square root of 20157?
About 141.9753.
Is 20157 divisible by 3?
Yes. Its digits add up to 15, a multiple of 3.
What is special about the number 20157?
20157 is a happy number: repeatedly adding the squares of its digits reaches 1; a semiprime: 3 × 6719, the product of two primes.