Search a number
-
+
50016077051 = 539291015823
BaseRepresentation
bin101110100101001100…
…001100010011111011
311210002201001222012012
4232211030030103323
51304413103431201
634551014040135
73420305432423
oct564514142373
9153081058165
1050016077051
111a236853a76
12983a34904b
1349411ab685
1425c6917483
15147aebd5bb
hexba530c4fb

50016077051 has 8 divisors (see below), whose sum is σ = 51014681280. Its totient is φ = 49019506432.

The previous prime is 50016077047. The next prime is 50016077099. The reversal of 50016077051 is 15077061005.

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

It is a cyclic number.

It is not a de Polignac number, because 50016077051 - 22 = 50016077047 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 250016077051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1016805.

The product of its (nonzero) digits is 7350, while the sum is 32.

The spelling of 50016077051 in words is "fifty billion, sixteen million, seventy-seven thousand, fifty-one".

Divisors: 1 53 929 49237 1015823 53838619 943699567 50016077051