Search a number
-
+
51002057161 = 1136712633653
BaseRepresentation
bin101111011111111101…
…011010000111001001
311212122102100221122001
4233133331122013021
51313423011312121
635232515031001
73453610222126
oct573775320711
9155572327561
1051002057161
111a6a2371470
129a7459b461
134a6a54a363
14267b85574d
1514d7830991
hexbdff5a1c9

51002057161 has 8 divisors (see below), whose sum is σ = 55790216064. Its totient is φ = 46239166320.

The previous prime is 51002057137. The next prime is 51002057177. The reversal of 51002057161 is 16175020015.

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 51002057161 - 215 = 51002024393 is a prime.

It is a super-2 number, since 2×510020571612 (a number of 22 digits) contains 22 as substring.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6312790 + ... + 6320863.

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

Almost surely, 251002057161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12634031.

The product of its (nonzero) digits is 2100, while the sum is 28.

Adding to 51002057161 its reverse (16175020015), we get a palindrome (67177077176).

The spelling of 51002057161 in words is "fifty-one billion, two million, fifty-seven thousand, one hundred sixty-one".

Divisors: 1 11 367 4037 12633653 138970183 4636550651 51002057161