Search a number
-
+
101022202022221 is a prime number
BaseRepresentation
bin10110111110000100010000…
…011101110100100101001101
3111020200121221221202112122001
4112332010100131310211031
5101220121432204202341
6554504543043352301
730164420225026114
oct2676042035644515
9436617857675561
10101022202022221
112a209303441a67
12b3b6943082691
13444a47807832c
141ad3701b86c7b
15ba2c4526cd31
hex5be11077494d

101022202022221 has 2 divisors, whose sum is σ = 101022202022222. Its totient is φ = 101022202022220.

The previous prime is 101022202022167. The next prime is 101022202022257. The reversal of 101022202022221 is 122220202220101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 83692582173225 + 17329619848996 = 9148365^2 + 4162886^2 .

It is a cyclic number.

It is not a de Polignac number, because 101022202022221 - 29 = 101022202021709 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (101022202022921) 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, 50511101011110 + 50511101011111.

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

Almost surely, 2101022202022221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 256, while the sum is 19.

Adding to 101022202022221 its reverse (122220202220101), we get a palindrome (223242404242322).

The spelling of 101022202022221 in words is "one hundred one trillion, twenty-two billion, two hundred two million, twenty-two thousand, two hundred twenty-one".