Search a number
-
+
101221212011077 is a prime number
BaseRepresentation
bin10111000000111101100110…
…011000101011101001000101
3111021101122122022011110011001
4113000331212120223221011
5101231402020233323302
6555140214410213301
730214663665024214
oct2700754630535105
9437348568143131
10101221212011077
112a285747392134
12b429423124231
134463172246aa2
141add1c059b07b
15ba7ee1835787
hex5c0f6662ba45

101221212011077 has 2 divisors, whose sum is σ = 101221212011078. Its totient is φ = 101221212011076.

The previous prime is 101221212010999. The next prime is 101221212011107. The reversal of 101221212011077 is 770110212122101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 88393109901121 + 12828102109956 = 9401761^2 + 3581634^2 .

It is a cyclic number.

It is not a de Polignac number, because 101221212011077 - 219 = 101221211486789 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101221216011077) 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 as a sum of consecutive naturals, namely, 50610606005538 + 50610606005539.

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

Almost surely, 2101221212011077 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 784, while the sum is 28.

Adding to 101221212011077 its reverse (770110212122101), we get a palindrome (871331424133178).

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