Search a number
-
+
51020350151 = 297161940031
BaseRepresentation
bin101111100001000011…
…001100001011000111
311212200200210022220012
4233201003030023013
51313442202201101
635234411100435
73454221551351
oct574103141307
9155620708805
1051020350151
111a701726241
129a7a74171b
134a71283804
1426800580d1
1514d9245bbb
hexbe10cc2c7

51020350151 has 16 divisors (see below), whose sum is σ = 53610854400. Its totient is φ = 48487538400.

The previous prime is 51020350141. The next prime is 51020350159. The reversal of 51020350151 is 15105302015.

It is a happy number.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-51020350151 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 251020350151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 40750.

The product of its (nonzero) digits is 750, while the sum is 23.

Adding to 51020350151 its reverse (15105302015), we get a palindrome (66125652166).

The spelling of 51020350151 in words is "fifty-one billion, twenty million, three hundred fifty thousand, one hundred fifty-one".

Divisors: 1 29 71 619 2059 17951 40031 43949 1160899 1274521 2842201 24779189 82423829 718596481 1759322419 51020350151