The number 52157
52157 is a composite number with 4 divisors. Its prime factorisation is 7 × 7451. Divisors (4): 1, 7, 7451, 52157.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52157: a semiprime: 7 × 7451, the product of two primes.
- 2
52157 is composite. Its prime factorisation is
- 3
The divisors add up to 59616; without 52157 itself that is 7459, so 52157 is deficient (7459 is less than 52157). Euler's totient φ(52157) = 44700 numbers up to 52157 share no factor with it.
- 4
The digits of 52157 add up to 20, and repeating that until one digit is left gives the digital root 2. The Collatz sequence (halve if even, else 3n+1) takes 83 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52157 = 7 \times 7451 \]
52157 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 59616 |
| Euler totient φ(n) | 44700 |
| Square | 2720352649 |
| Cube | 141885433113893 |
| Square root | 228.379071 |
| Digit sum / digital root | 20 / 2 |
| Collatz steps to 1 | 83 |
| Scientific notation | 5.2157 × |
52157 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand one hundred and fifty-seven |
| Binary (base 2) | 1100101110111101 |
| Octal (base 8) | 145675 |
| Hexadecimal (base 16) | CBBD |
| Base 3 | 2122112202 |
| As time | 52157 seconds = 14 h 29 min 17 s |
Is 52157 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 2) | 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 5) | A number is divisible by 6 if it is divisible by both 2 and 3. |
| 7 | Yes (52157 ÷ 7 = 7451) | 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 2) | 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 6) | A number is divisible by 11 if the alternating sum of the digits is a multiple of 11. |
| 12 | No (remainder 5) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52157 a prime number?
No. 52157 = 7 × 7451, so it is divisible by 7.
What are the factors of 52157?
1, 7, 7451, 52157.
What is 52157 in binary?
1100101110111101 (hexadecimal CBBD, octal 145675).
What is the square root of 52157?
About 228.3791.
Is 52157 divisible by 3?
No. Its digits add up to 20, which is not a multiple of 3.
What is special about the number 52157?
52157 is a semiprime: 7 × 7451, the product of two primes.