Search a number
-
+
53026125 = 353141403
BaseRepresentation
bin1100101001000…
…1110101001101
310200210000011120
43022101311031
5102033314000
65132311153
71212500055
oct312216515
9120700146
1053026125
1127a28349
12159124b9
13aca7909
147084565
1549c66a0
hex3291d4d

53026125 has 16 divisors (see below), whose sum is σ = 88236096. Its totient is φ = 28280400.

The previous prime is 53026121. The next prime is 53026133. The reversal of 53026125 is 52162035.

53026125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 53026125 - 22 = 53026121 is a prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 53026095 and 53026104.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (53026121) by changing a digit.

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 15 ways as a sum of consecutive naturals, for example, 70327 + ... + 71076.

It is an arithmetic number, because the mean of its divisors is an integer number (5514756).

Almost surely, 253026125 is an apocalyptic number.

It is an amenable number.

53026125 is a deficient number, since it is larger than the sum of its proper divisors (35209971).

53026125 is a wasteful number, since it uses less digits than its factorization.

53026125 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 141421 (or 141411 counting only the distinct ones).

The product of its (nonzero) digits is 1800, while the sum is 24.

The square root of 53026125 is about 7281.9039405914. The cubic root of 53026125 is about 375.6902841301.

The spelling of 53026125 in words is "fifty-three million, twenty-six thousand, one hundred twenty-five".

Divisors: 1 3 5 15 25 75 125 375 141403 424209 707015 2121045 3535075 10605225 17675375 53026125