Search a number
-
+
51020126515 = 5223267717093
BaseRepresentation
bin101111100001000010…
…010101100100110011
311212200200100222010101
4233201002111210303
51313442123022030
635234402213231
73454216630351
oct574102254463
9155620328111
1051020126515
111a701593216
129a7a654217
134a71205a97
14267ddda7d1
1514d91ee7ca
hexbe1095933

51020126515 has 16 divisors (see below), whose sum is σ = 61525271808. Its totient is φ = 40615514496.

The previous prime is 51020126449. The next prime is 51020126519. The reversal of 51020126515 is 51562102015.

It is not a de Polignac number, because 51020126515 - 213 = 51020118323 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2976309 + ... + 2993401.

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

Almost surely, 251020126515 is an apocalyptic number.

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

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

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

The sum of its prime factors is 19998.

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

The spelling of 51020126515 in words is "fifty-one billion, twenty million, one hundred twenty-six thousand, five hundred fifteen".

Divisors: 1 5 223 1115 2677 13385 17093 85465 596971 2984855 3811739 19058695 45757961 228789805 10204025303 51020126515