Base | Representation |
---|---|
bin | 1100011010010… |
… | …1010111000000 |
3 | 10121221210111220 |
4 | 3012211113000 |
5 | 101311320121 |
6 | 5055435040 |
7 | 1201324146 |
oct | 306452700 |
9 | 117853456 |
10 | 52057536 |
11 | 27426663 |
12 | 15525a80 |
13 | aa28a9b |
14 | 6cb1596 |
15 | 48846c6 |
hex | 31a55c0 |
52057536 has 112 divisors (see below), whose sum is σ = 149778720. Its totient is φ = 15892480.
The previous prime is 52057531. The next prime is 52057543. The reversal of 52057536 is 63575025.
It is a junction number, because it is equal to n+sod(n) for n = 52057497 and 52057506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (52057531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 133630 + ... + 134018.
It is an arithmetic number, because the mean of its divisors is an integer number (1337310).
Almost surely, 252057536 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52057536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74889360).
52057536 is an abundant number, since it is smaller than the sum of its proper divisors (97721184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52057536 is a wasteful number, since it uses less digits than its factorization.
52057536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 462 (or 452 counting only the distinct ones).
The product of its (nonzero) digits is 31500, while the sum is 33.
The square root of 52057536 is about 7215.0908518188. The cubic root of 52057536 is about 373.3887276080.
The spelling of 52057536 in words is "fifty-two million, fifty-seven thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •