The number 52159
52159 is a composite number with 4 divisors. Its prime factorisation is 43 × 1213. Divisors (4): 1, 43, 1213, 52159.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52159: a semiprime: 43 × 1213, the product of two primes.
- 2
52159 is composite. Its prime factorisation is
- 3
The divisors add up to 53416; without 52159 itself that is 1257, so 52159 is deficient (1257 is less than 52159). Euler's totient φ(52159) = 50904 numbers up to 52159 share no factor with it.
- 4
The digits of 52159 add up to 22, and repeating that until one digit is left gives the digital root 4. The Collatz sequence (halve if even, else 3n+1) takes 202 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52159 = 43 \times 1213 \]
52159 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 53416 |
| Euler totient φ(n) | 50904 |
| Square | 2720561281 |
| Cube | 141901755855679 |
| Square root | 228.383449 |
| Digit sum / digital root | 22 / 4 |
| Collatz steps to 1 | 202 |
| Scientific notation | 5.2159 × |
52159 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand one hundred and fifty-nine |
| Binary (base 2) | 1100101110111111 |
| Octal (base 8) | 145677 |
| Hexadecimal (base 16) | CBBF |
| Base 3 | 2122112211 |
| As time | 52159 seconds = 14 h 29 min 19 s |
Is 52159 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 3) | A number is divisible by 4 if the last two digits make a multiple of 4. |
| 5 | No (remainder 4) | 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 2) | 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 4) | A number is divisible by 9 if the digits add up to a multiple of 9. |
| 10 | No (remainder 9) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52159 a prime number?
No. 52159 = 43 × 1213, so it is divisible by 43.
What are the factors of 52159?
1, 43, 1213, 52159.
What is 52159 in binary?
1100101110111111 (hexadecimal CBBF, octal 145677).
What is the square root of 52159?
About 228.3834.
Is 52159 divisible by 3?
No. Its digits add up to 22, which is not a multiple of 3.
What is special about the number 52159?
52159 is a semiprime: 43 × 1213, the product of two primes.