Search a number
-
+
101102220011077 is a prime number
BaseRepresentation
bin10110111111001110110001…
…111010001110011001000101
3111020222021111112201112200221
4112333032301322032121011
5101222424321310323302
6555005415122504341
730203252155512265
oct2677166172163105
9436867445645627
10101102220011077
112a23a23551536a
12b40a354b050b1
134454b8ab3b02c
141ad75330857a5
15ba4d7a0e1937
hex5bf3b1e8e645

101102220011077 has 2 divisors, whose sum is σ = 101102220011078. Its totient is φ = 101102220011076.

The previous prime is 101102220011011. The next prime is 101102220011083. The reversal of 101102220011077 is 770110022201101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73800487299841 + 27301732711236 = 8590721^2 + 5225106^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2101102220011077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 392, while the sum is 25.

Adding to 101102220011077 its reverse (770110022201101), we get a palindrome (871212242212178).

The spelling of 101102220011077 in words is "one hundred one trillion, one hundred two billion, two hundred twenty million, eleven thousand, seventy-seven".