Search a number
-
+
50161776566113 is a prime number
BaseRepresentation
bin10110110011111001100101…
…10111111001111101100001
320120121102022110022022200201
423121330302313321331201
523033322304300103423
6254404000234345201
713365032404511302
oct1331746267717541
9216542273268621
1050161776566113
1114a8a54317a703
12576183158b201
1321cb309a66544
14c55bb30547a9
155bec525772ad
hex2d9f32df9f61

50161776566113 has 2 divisors, whose sum is σ = 50161776566114. Its totient is φ = 50161776566112.

The previous prime is 50161776566051. The next prime is 50161776566171. The reversal of 50161776566113 is 31166567716105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 44911134286929 + 5250642279184 = 6701577^2 + 2291428^2 .

It is a cyclic number.

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

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

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

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

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

Almost surely, 250161776566113 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4762800, while the sum is 55.

The spelling of 50161776566113 in words is "fifty trillion, one hundred sixty-one billion, seven hundred seventy-six million, five hundred sixty-six thousand, one hundred thirteen".