Search a number
-
+
1022110020221 is a prime number
BaseRepresentation
bin11101101111110101000…
…00010011001001111101
310121201020121022211022212
432313322200103021331
5113221240131121341
62101314552550205
7133562560552253
oct16677240231175
93551217284285
101022110020221
11364524507384
121461126b2365
13754ccb5c144
1437682a665d3
151b8c28785eb
hexedfa81327d

1022110020221 has 2 divisors, whose sum is σ = 1022110020222. Its totient is φ = 1022110020220.

The previous prime is 1022110020137. The next prime is 1022110020233. The reversal of 1022110020221 is 1220200112201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 636183307321 + 385926712900 = 797611^2 + 621230^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 1022110020196 and 1022110020205.

It is a congruent number.

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

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

Almost surely, 21022110020221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 32, while the sum is 14.

Adding to 1022110020221 its reverse (1220200112201), we get a palindrome (2242310132422).

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