Search a number
-
+
50564069050141 is a prime number
BaseRepresentation
bin10110111111100110111010…
…10111111100011100011101
320122000212200220120221120101
423133303131113330130131
523111420203134101031
6255312451310421101
713436063524301233
oct1337633527743435
9218025626527511
1050564069050141
111512511285a1a9
1258077a4501791
13222a22c3179ba
14c6b45788a953
155ca44a35a361
hex2dfcdd5fc71d

50564069050141 has 2 divisors, whose sum is σ = 50564069050142. Its totient is φ = 50564069050140.

The previous prime is 50564069050129. The next prime is 50564069050151. The reversal of 50564069050141 is 14105096046505.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 49957896248100 + 606172802041 = 7068090^2 + 778571^2 .

It is a cyclic number.

It is not a de Polignac number, because 50564069050141 - 29 = 50564069049629 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50564069050151) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25282034525070 + 25282034525071.

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

Almost surely, 250564069050141 is an apocalyptic number.

It is an amenable number.

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

50564069050141 is an equidigital number, since it uses as much as digits as its factorization.

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

The product of its (nonzero) digits is 648000, while the sum is 46.

The spelling of 50564069050141 in words is "fifty trillion, five hundred sixty-four billion, sixty-nine million, fifty thousand, one hundred forty-one".