Base | Representation |
---|---|
bin | 1100100001100… |
… | …0101111001101 |
3 | 10122211210210012 |
4 | 3020120233031 |
5 | 101421431000 |
6 | 5113523005 |
7 | 1205333024 |
oct | 310305715 |
9 | 118753705 |
10 | 52530125 |
11 | 2771972a |
12 | 15713465 |
13 | ab62c1b |
14 | 6d958bb |
15 | 4929735 |
hex | 3218bcd |
52530125 has 8 divisors (see below), whose sum is σ = 65557752. Its totient is φ = 42024000.
The previous prime is 52530109. The next prime is 52530139. The reversal of 52530125 is 52103525.
52530125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 2601769 + 49928356 = 1613^2 + 7066^2 .
It is not a de Polignac number, because 52530125 - 24 = 52530109 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 52530125.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 209996 + ... + 210245.
It is an arithmetic number, because the mean of its divisors is an integer number (8194719).
Almost surely, 252530125 is an apocalyptic number.
It is an amenable number.
52530125 is a deficient number, since it is larger than the sum of its proper divisors (13027627).
52530125 is an equidigital number, since it uses as much as digits as its factorization.
52530125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420256 (or 420246 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 23.
The square root of 52530125 is about 7247.7668974657. The cubic root of 52530125 is about 374.5152254382.
The spelling of 52530125 in words is "fifty-two million, five hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •