Search a number
-
+
51011131201 = 1928320534621
BaseRepresentation
bin101111100000100000…
…000001011101000001
311212200001102221212121
4233200200001131001
51313432322144301
635233441324241
73454050314062
oct574040013501
9155601387777
1051011131201
111a6a74a9978
129a77636681
134a6c3a6604
14267cb38569
1514d85243a1
hexbe0801741

51011131201 has 16 divisors (see below), whose sum is σ = 53923579840. Its totient is φ = 48121698240.

The previous prime is 51011131181. The next prime is 51011131219. The reversal of 51011131201 is 10213111015.

It is a happy number.

It is not a de Polignac number, because 51011131201 - 29 = 51011130689 is a prime.

It is a Duffinian number.

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

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

Almost surely, 251011131201 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6976.

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 51011131201 its reverse (10213111015), we get a palindrome (61224242216).

The spelling of 51011131201 in words is "fifty-one billion, eleven million, one hundred thirty-one thousand, two hundred one".

Divisors: 1 19 283 2053 4621 5377 39007 87799 580999 1307743 9486913 11038981 24847117 180251347 2684796379 51011131201