Search a number
-
+
53015125 = 53424121
BaseRepresentation
bin1100101000111…
…1001001010101
310200202110002011
43022033021111
5102032441000
65132144221
71212423022
oct312171125
9120673064
1053015125
1127a20059
1215908071
13aca28c7
147080549
1549c32ba
hex328f255

53015125 has 8 divisors (see below), whose sum is σ = 66163032. Its totient is φ = 42412000.

The previous prime is 53015119. The next prime is 53015141. The reversal of 53015125 is 52151035.

53015125 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 17123044 + 35892081 = 4138^2 + 5991^2 .

It is not a de Polignac number, because 53015125 - 29 = 53014613 is a prime.

It is a Duffinian number.

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

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, 211936 + ... + 212185.

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

Almost surely, 253015125 is an apocalyptic number.

It is an amenable number.

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

53015125 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 750, while the sum is 22.

The square root of 53015125 is about 7281.1486044442. The cubic root of 53015125 is about 375.6643039872.

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

Divisors: 1 5 25 125 424121 2120605 10603025 53015125