Search a number
-
+
50106051051061 is a prime number
BaseRepresentation
bin10110110010010001110010…
…10111111011111000110101
320120102002110211220211221211
423121020321113323320311
523031414143032113221
6254322222503241421
713361020440450655
oct1331107127737065
9216362424824854
1050106051051061
1114a68947613435
125752a7b149271
1321c5c98a640b5
14c53208166365
155bd5902186e1
hex2d92395fbe35

50106051051061 has 2 divisors, whose sum is σ = 50106051051062. Its totient is φ = 50106051051060.

The previous prime is 50106051051037. The next prime is 50106051051073. The reversal of 50106051051061 is 16015015060105.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 40460094680625 + 9645956370436 = 6360825^2 + 3105794^2 .

It is a cyclic number.

It is not a de Polignac number, because 50106051051061 - 27 = 50106051050933 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 250106051051061 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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