The number 52791
52791 is a composite number with 4 divisors. Its prime factorisation is 3 × 17597. Divisors (4): 1, 3, 17597, 52791.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52791: a semiprime: 3 × 17597, the product of two primes.
- 2
52791 is composite. Its prime factorisation is
- 3
The divisors add up to 70392; without 52791 itself that is 17601, so 52791 is deficient (17601 is less than 52791). Euler's totient φ(52791) = 35192 numbers up to 52791 share no factor with it.
- 4
The digits of 52791 add up to 24, and repeating that until one digit is left gives the digital root 6. The Collatz sequence (halve if even, else 3n+1) takes 153 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52791 = 3 \times 17597 \]
52791 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 70392 |
| Euler totient φ(n) | 35192 |
| Square | 2786889681 |
| Cube | 147122693149671 |
| Square root | 229.762921 |
| Digit sum / digital root | 24 / 6 |
| Collatz steps to 1 | 153 |
| Scientific notation | 5.2791 × |
52791 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand seven hundred and ninety-one |
| Binary (base 2) | 1100111000110111 |
| Octal (base 8) | 147067 |
| Hexadecimal (base 16) | CE37 |
| Base 3 | 2200102020 |
| As time | 52791 seconds = 14 h 39 min 51 s |
Is 52791 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 (52791 ÷ 3 = 17597) | 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 | No (remainder 2) | 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 52791 a prime number?
No. 52791 = 3 × 17597, so it is divisible by 3.
What are the factors of 52791?
1, 3, 17597, 52791.
What is 52791 in binary?
1100111000110111 (hexadecimal CE37, octal 147067).
What is the square root of 52791?
About 229.7629.
Is 52791 divisible by 3?
Yes. Its digits add up to 24, a multiple of 3.
What is special about the number 52791?
52791 is a semiprime: 3 × 17597, the product of two primes.