Search a number
-
+
50051101111 = 119479480019
BaseRepresentation
bin101110100111010001…
…110011000110110111
311210012010222101011121
4232213101303012313
51310001040213421
634554304444411
73421212224404
oct564721630667
9153163871147
1050051101111
111a2545a6080
12984a019707
13494852237b
1425cb4332ab
15147e0dad41
hexba74731b7

50051101111 has 8 divisors (see below), whose sum is σ = 54607075200. Its totient is φ = 45496106040.

The previous prime is 50051101099. The next prime is 50051101117. The reversal of 50051101111 is 11110115005.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 50051101111 - 221 = 50049003959 is a prime.

It is a super-2 number, since 2×500511011112 (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 (50051101117) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 135741 + ... + 344278.

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

Almost surely, 250051101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 489509.

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

Adding to 50051101111 its reverse (11110115005), we get a palindrome (61161216116).

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

Divisors: 1 11 9479 104269 480019 5280209 4550100101 50051101111