Search a number
-
+
50161001115 = 3523931397437
BaseRepresentation
bin101110101101110101…
…000010001010011011
311210110210202212122010
4232231311002022123
51310212204013430
635013232201003
73424015321521
oct565565021233
9153423685563
1050161001115
111a300639625
12987a999163
134965221064
1425dbc80311
151488a98cb0
hexbadd4229b

50161001115 has 16 divisors (see below), whose sum is σ = 80291197728. Its totient is φ = 26741335296.

The previous prime is 50161001063. The next prime is 50161001119. The reversal of 50161001115 is 51110016105.

It is a happy number.

It is not a de Polignac number, because 50161001115 - 27 = 50161000987 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 50161001091 and 50161001100.

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

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

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

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

Almost surely, 250161001115 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1399838.

The product of its (nonzero) digits is 150, while the sum is 21.

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

Divisors: 1 3 5 15 2393 7179 11965 35895 1397437 4192311 6987185 20961555 3344066741 10032200223 16720333705 50161001115