Search a number
-
+
50050555501 = 431163966407
BaseRepresentation
bin101110100111001111…
…101101111001101101
311210012002221122201211
4232213033231321231
51310000420234001
634554245034421
73421204462612
oct564717557155
9153162848654
1050050555501
111a254263161
1298499b5a11
134948390c1b
1425cb330509
15147e02e351
hexba73ede6d

50050555501 has 4 divisors (see below), whose sum is σ = 51214521952. Its totient is φ = 48886589052.

The previous prime is 50050555493. The next prime is 50050555531. The reversal of 50050555501 is 10555505005.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 50050555501 - 23 = 50050555493 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 581983161 + ... + 581983246.

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

Almost surely, 250050555501 is an apocalyptic number.

It is an amenable number.

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

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

50050555501 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1163966450.

The product of its (nonzero) digits is 15625, while the sum is 31.

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

Divisors: 1 43 1163966407 50050555501