Search a number
-
+
51050161611 = 32171033239429
BaseRepresentation
bin101111100010110100…
…111010010111001011
311212202202212220112100
4233202310322113023
51314022320132421
635241354044443
73455033133261
oct574264722713
9155682786470
1051050161611
111a717538009
129a88719723
134a774c0a27
142683db8431
1514dbb83c26
hexbe2d3a5cb

51050161611 has 24 divisors (see below), whose sum is σ = 78834768480. Its totient is φ = 31720478976.

The previous prime is 51050161607. The next prime is 51050161621. The reversal of 51050161611 is 11616105015.

It is not a de Polignac number, because 51050161611 - 22 = 51050161607 is a prime.

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

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1603956 + ... + 1635473.

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

Almost surely, 251050161611 is an apocalyptic number.

51050161611 is a gapful number since it is divisible by the number (51) formed by its first and last digit.

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

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

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

The sum of its prime factors is 3239555 (or 3239552 counting only the distinct ones).

The product of its (nonzero) digits is 900, while the sum is 27.

Adding to 51050161611 its reverse (11616105015), we get a palindrome (62666266626).

The spelling of 51050161611 in words is "fifty-one billion, fifty million, one hundred sixty-one thousand, six hundred eleven".

Divisors: 1 3 9 17 51 103 153 309 927 1751 5253 15759 3239429 9718287 29154861 55070293 165210879 333661187 495632637 1000983561 3002950683 5672240179 17016720537 51050161611