Search a number
-
+
51013151 = 727726309
BaseRepresentation
bin1100001010011…
…0011000011111
310112222201212222
43002212120133
5101024410101
65021215555
71156414250
oct302463037
9115881788
1051013151
1126882a32
12151015bb
13a7515c7
146abcb27
15472a01b
hex30a661f

51013151 has 8 divisors (see below), whose sum is σ = 58513440. Its totient is φ = 43566048.

The previous prime is 51013129. The next prime is 51013159. The reversal of 51013151 is 15131015.

51013151 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 51013151 - 26 = 51013087 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (51013159) 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, 11216 + ... + 15093.

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

Almost surely, 251013151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 26593.

The product of its (nonzero) digits is 75, while the sum is 17.

The square root of 51013151 is about 7142.3491233627. The cubic root of 51013151 is about 370.8748497165.

Adding to 51013151 its reverse (15131015), we get a palindrome (66144166).

The spelling of 51013151 in words is "fifty-one million, thirteen thousand, one hundred fifty-one".

Divisors: 1 7 277 1939 26309 184163 7287593 51013151