Search a number
-
+
50041102111 = 7111349991111
BaseRepresentation
bin101110100110101011…
…101001111100011111
311210011110011101010021
4232212223221330133
51304441010231421
634553310253011
73421031230660
oct564653517437
9153143141107
1050041102111
111a249996740
1298467b7167
1349464310c0
1425c9d8d367
15147d2b3341
hexba6ae9f1f

50041102111 has 16 divisors (see below), whose sum is σ = 67188054528. Its totient is φ = 35993599200.

The previous prime is 50041102099. The next prime is 50041102117. The reversal of 50041102111 is 11120114005.

It is not a de Polignac number, because 50041102111 - 25 = 50041102079 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 250041102111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 49991142.

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

Adding to 50041102111 its reverse (11120114005), we get a palindrome (61161216116).

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

Divisors: 1 7 11 13 77 91 143 1001 49991111 349937777 549902221 649884443 3849315547 4549191101 7148728873 50041102111