Search a number
-
+
51015225 = 352680203
BaseRepresentation
bin1100001010011…
…0111000111001
310112222211201210
43002212320321
5101024441400
65021233333
71156423302
oct302467071
9115884653
1051015225
1126884548
1215102849
13a752531
146abd7a9
15472a950
hex30a6e39

51015225 has 12 divisors (see below), whose sum is σ = 84345296. Its totient is φ = 27208080.

The previous prime is 51015221. The next prime is 51015229. The reversal of 51015225 is 52251015.

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

It is an interprime number because it is at equal distance from previous prime (51015221) and next prime (51015229).

It is not a de Polignac number, because 51015225 - 22 = 51015221 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (51015221) 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 11 ways as a sum of consecutive naturals, for example, 340027 + ... + 340176.

Almost surely, 251015225 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 500, while the sum is 21.

The square root of 51015225 is about 7142.4943122133. The cubic root of 51015225 is about 370.8798757670.

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

Divisors: 1 3 5 15 25 75 680203 2040609 3401015 10203045 17005075 51015225