Search a number
-
+
50050553501 = 1322916812413
BaseRepresentation
bin101110100111001111…
…101101011010011101
311210012002221112222202
4232213033231122131
51310000420203001
634554245021245
73421204454024
oct564717553235
9153162845882
1050050553501
111a254261703
1298499b4825
134948390040
1425cb32d8bb
15147e02d96b
hexba73ed69d

50050553501 has 8 divisors (see below), whose sum is σ = 54135973080. Its totient is φ = 45998759232.

The previous prime is 50050553491. The next prime is 50050553507. The reversal of 50050553501 is 10535505005.

It can be written as a sum of positive squares in 4 ways, for example, as 23051134276 + 26999419225 = 151826^2 + 164315^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-50050553501 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

Almost surely, 250050553501 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16812655.

The product of its (nonzero) digits is 9375, while the sum is 29.

The spelling of 50050553501 in words is "fifty billion, fifty million, five hundred fifty-three thousand, five hundred one".

Divisors: 1 13 229 2977 16812413 218561369 3850042577 50050553501