Search a number
-
+
50050156660611 = 316683385553537
BaseRepresentation
bin10110110000101001101011…
…10011110000011110000011
320120012202012110202121201120
423120110311303300132003
523030010210101114421
6254240420300403323
713354001353124262
oct1330246563603603
9216182173677646
1050050156660611
1114a471746a2618
125744080246543
1321c092ba84493
14c50624a785d9
155bbdbd14c8c6
hex2d8535cf0783

50050156660611 has 4 divisors (see below), whose sum is σ = 66733542214152. Its totient is φ = 33366771107072.

The previous prime is 50050156660607. The next prime is 50050156660627. The reversal of 50050156660611 is 11606665105005.

50050156660611 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 50050156660611 - 22 = 50050156660607 is a prime.

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

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

Almost surely, 250050156660611 is an apocalyptic number.

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

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

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

The sum of its prime factors is 16683385553540.

The product of its (nonzero) digits is 162000, while the sum is 42.

The spelling of 50050156660611 in words is "fifty trillion, fifty billion, one hundred fifty-six million, six hundred sixty thousand, six hundred eleven".

Divisors: 1 3 16683385553537 50050156660611