Search a number
-
+
51026151 = 3111546247
BaseRepresentation
bin1100001010100…
…1100011100111
310120000101201110
43002221203213
5101030314101
65021400103
71156500201
oct302514347
9116011643
1051026151
1126891780
1215109033
13a7574b7
146ac3771
15472dcd6
hex30a98e7

51026151 has 8 divisors (see below), whose sum is σ = 74219904. Its totient is φ = 30924920.

The previous prime is 51026147. The next prime is 51026189. The reversal of 51026151 is 15162015.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 51026151 - 22 = 51026147 is a prime.

It is a congruent number.

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

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

Almost surely, 251026151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1546261.

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

The square root of 51026151 is about 7143.2591301170. The cubic root of 51026151 is about 370.9063511592.

Adding to 51026151 its reverse (15162015), we get a palindrome (66188166).

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

Divisors: 1 3 11 33 1546247 4638741 17008717 51026151