Search a number
-
+
51006105110 = 2527129364237
BaseRepresentation
bin101111100000001100…
…110110011000010110
311212122200222121101002
4233200030312120112
51313430030330420
635233141503302
73453656511542
oct574014663026
9155580877332
1051006105110
111a6a4686784
129a75a11b32
134a6b3369ac
14267c1caa22
1514d7d80075
hexbe0336616

51006105110 has 32 divisors (see below), whose sum is σ = 92465718912. Its totient is φ = 20257464960.

The previous prime is 51006105079. The next prime is 51006105133. The reversal of 51006105110 is 1150160015.

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

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

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, 761912 + ... + 826148.

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

Almost surely, 251006105110 is an apocalyptic number.

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

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

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

The sum of its prime factors is 64808.

The product of its (nonzero) digits is 150, while the sum is 20.

Adding to 51006105110 its reverse (1150160015), we get a palindrome (52156265125).

The spelling of 51006105110 in words is "fifty-one billion, six million, one hundred five thousand, one hundred ten".

Divisors: 1 2 5 10 271 293 542 586 1355 1465 2710 2930 64237 79403 128474 158806 321185 397015 642370 794030 17408227 18821441 34816454 37642882 87041135 94107205 174082270 188214410 5100610511 10201221022 25503052555 51006105110