Search a number
-
+
50100011061 = 3371094140839
BaseRepresentation
bin101110101010001100…
…011000000000110101
311210022120000021000020
4232222030120000311
51310101100323221
635003213035353
73422345032122
oct565214300065
9153276007006
1050100011061
111a27a171921
129862485b59
1349556b8579
1425d3b25749
15148354cac6
hexbaa318035

50100011061 has 16 divisors (see below), whose sum is σ = 69234844800. Its totient is φ = 32199156288.

The previous prime is 50100011051. The next prime is 50100011063. The reversal of 50100011061 is 16011000105.

It is not a de Polignac number, because 50100011061 - 29 = 50100010549 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 50100011061.

It is a congruent number.

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

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

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

Almost surely, 250100011061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4140988.

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

Adding to 50100011061 its reverse (16011000105), we get a palindrome (66111011166).

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

Divisors: 1 3 37 109 111 327 4033 12099 4140839 12422517 153211043 451351451 459633129 1354054353 16700003687 50100011061