Search a number
-
+
50500101100 = 2252505001011
BaseRepresentation
bin101111000010000010…
…100110001111101100
311211100102211221100211
4233002002212033230
51311411011213400
635111024232204
73435303530311
oct570202461754
9154312757324
1050500101100
111a464a99449
12995446b664
1349ba55bb37
142630d10d08
1514a872cdba
hexbc20a63ec

50500101100 has 18 divisors (see below), whose sum is σ = 109585219604. Its totient is φ = 20200040400.

The previous prime is 50500101061. The next prime is 50500101109. The reversal of 50500101100 is 110100505.

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

It is not an unprimeable number, because it can be changed into a prime (50500101109) 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 5 ways as a sum of consecutive naturals, for example, 252500406 + ... + 252500605.

Almost surely, 250500101100 is an apocalyptic number.

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

It is an amenable number.

50500101100 is an abundant number, since it is smaller than the sum of its proper divisors (59085118504).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 25, while the sum is 13.

Adding to 50500101100 its reverse (110100505), we get a palindrome (50610201605).

The spelling of 50500101100 in words is "fifty billion, five hundred million, one hundred one thousand, one hundred".

Divisors: 1 2 4 5 10 20 25 50 100 505001011 1010002022 2020004044 2525005055 5050010110 10100020220 12625025275 25250050550 50500101100