Search a number
-
+
51150659951 = 232752312853
BaseRepresentation
bin101111101000110100…
…010010000101101111
311220000202222202100002
4233220310102011233
51314224032104301
635255344054515
73460363302326
oct575064220557
9156022882302
1051150659951
111a769239996
129ab630443b
134a9227a2c1
1426934990bd
1514e58d616b
hexbe8d1216f

51150659951 has 12 divisors (see below), whose sum is σ = 53482563288. Its totient is φ = 48916408464.

The previous prime is 51150659939. The next prime is 51150659977. The reversal of 51150659951 is 15995605115.

It is a happy number.

It is not a de Polignac number, because 51150659951 - 26 = 51150659887 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3973241 + ... + 3986093.

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

Almost surely, 251150659951 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 303750, while the sum is 47.

The spelling of 51150659951 in words is "fifty-one billion, one hundred fifty million, six hundred fifty-nine thousand, nine hundred fifty-one".

Divisors: 1 23 529 7523 12853 173029 295619 3979667 6799237 96693119 2223941737 51150659951