Search a number
-
+
50011005011 = 112413314091
BaseRepresentation
bin101110100100111000…
…110110000001010011
311210002100112021122212
4232210320312001103
51304410304130021
634550313222335
73420214346222
oct564470660123
9153070467585
1050011005011
111a2339aa300
1298387019ab
134940123b76
1425c5d96cb9
15147a81a85b
hexba4e36053

50011005011 has 6 divisors (see below), whose sum is σ = 54970774236. Its totient is φ = 45464549900.

The previous prime is 50011004993. The next prime is 50011005041. The reversal of 50011005011 is 11050011005.

It is a de Polignac number, because none of the positive numbers 2k-50011005011 is a prime.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (50011005041) 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, 206656925 + ... + 206657166.

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

Almost surely, 250011005011 is an apocalyptic number.

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

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

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

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

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

Adding to 50011005011 its reverse (11050011005), we get a palindrome (61061016016).

The spelling of 50011005011 in words is "fifty billion, eleven million, five thousand, eleven".

Divisors: 1 11 121 413314091 4546455001 50011005011