Search a number
-
+
50705118037 = 719499764011
BaseRepresentation
bin101111001110010000…
…101011001101010101
311211212201121212201201
4233032100223031111
51312321002234122
635143230352501
73443343251320
oct571620531525
9154781555651
1050705118037
111a55a798732
1299b105b731
134a20b81832
14265023b7b7
1514bb728a27
hexbce42b355

50705118037 has 16 divisors (see below), whose sum is σ = 61120960000. Its totient is φ = 41091513840.

The previous prime is 50705118031. The next prime is 50705118041. The reversal of 50705118037 is 73081150705.

It is a cyclic number.

It is not a de Polignac number, because 50705118037 - 215 = 50705085269 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 250705118037 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 764536.

The product of its (nonzero) digits is 29400, while the sum is 37.

The spelling of 50705118037 in words is "fifty billion, seven hundred five million, one hundred eighteen thousand, thirty-seven".

Divisors: 1 7 19 133 499 3493 9481 66367 764011 5348077 14516209 101613463 381241489 2668690423 7243588291 50705118037