Search a number
-
+
50701157049 = 361277055503
BaseRepresentation
bin101111001110000001…
…100100001010111001
311211212110011122021110
4233032001210022321
51312313444011144
635143005430533
73443264503254
oct571601441271
9154773148243
1050701157049
111a558532794
1299ab86b449
134a200c595a
14264d8ca09b
1514bb1e50b9
hexbce0642b9

50701157049 has 8 divisors (see below), whose sum is σ = 68709764992. Its totient is φ = 33246660240.

The previous prime is 50701157027. The next prime is 50701157063. The reversal of 50701157049 is 94075110705.

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

It is not a de Polignac number, because 50701157049 - 216 = 50701091513 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

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

It is not an unprimeable number, because it can be changed into a prime (50701157099) 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 7 ways as a sum of consecutive naturals, for example, 138527569 + ... + 138527934.

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

Almost surely, 250701157049 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 277055567.

The product of its (nonzero) digits is 44100, while the sum is 39.

The spelling of 50701157049 in words is "fifty billion, seven hundred one million, one hundred fifty-seven thousand, forty-nine".

Divisors: 1 3 61 183 277055503 831166509 16900385683 50701157049