The number 52351
52351 is a composite number with 4 divisors. Its prime factorisation is 13 × 4027. Divisors (4): 1, 13, 4027, 52351.
Pick any whole number from 1 to 100,000.
How to work it out
- 1
What is special about 52351: a semiprime: 13 × 4027, the product of two primes.
- 2
52351 is composite. Its prime factorisation is
- 3
The divisors add up to 56392; without 52351 itself that is 4041, so 52351 is deficient (4041 is less than 52351). Euler's totient φ(52351) = 48312 numbers up to 52351 share no factor with it.
- 4
The digits of 52351 add up to 16, and repeating that until one digit is left gives the digital root 7. The Collatz sequence (halve if even, else 3n+1) takes 109 steps to reach 1.
LaTeX source of the formulas on this page
\[ 52351 = 13 \times 4027 \]
52351 at a glance
| Property | Value |
|---|---|
| Type | composite |
| Number of divisors | 4 |
| Sum of divisors | 56392 |
| Euler totient φ(n) | 48312 |
| Square | 2740627201 |
| Cube | 143474574599551 |
| Square root | 228.803409 |
| Digit sum / digital root | 16 / 7 |
| Collatz steps to 1 | 109 |
| Scientific notation | 5.2351 × |
52351 in other forms
| Form | Value |
|---|---|
| In words | fifty-two thousand three hundred and fifty-one |
| Binary (base 2) | 1100110001111111 |
| Octal (base 8) | 146177 |
| Hexadecimal (base 16) | CC7F |
| Base 3 | 2122210221 |
| As time | 52351 seconds = 14 h 32 min 31 s |
Is 52351 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 1) | 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 7) | A number is divisible by 8 if the last three digits make a multiple of 8. |
| 9 | No (remainder 7) | 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 7) | A number is divisible by 12 if it is divisible by both 3 and 4. |
Questions
Is 52351 a prime number?
No. 52351 = 13 × 4027, so it is divisible by 13.
What are the factors of 52351?
1, 13, 4027, 52351.
What is 52351 in binary?
1100110001111111 (hexadecimal CC7F, octal 146177).
What is the square root of 52351?
About 228.8034.
Is 52351 divisible by 3?
No. Its digits add up to 16, which is not a multiple of 3.
What is special about the number 52351?
52351 is a semiprime: 13 × 4027, the product of two primes.