Search a number
-
+
1102201220111 is a prime number
BaseRepresentation
bin10000000010100000010…
…011111110110000001111
310220100222022001100001112
4100002200103332300033
5121024302003020421
62202202205202235
7142426400534615
oct20024023766017
93810868040045
101102201220111
11395493944272
12159744b6037b
137cc24b46094
143b4bd9816b5
151da0dd5e45b
hex100a04fec0f

1102201220111 has 2 divisors, whose sum is σ = 1102201220112. Its totient is φ = 1102201220110.

The previous prime is 1102201220101. The next prime is 1102201220119. The reversal of 1102201220111 is 1110221022011.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1102201220111 - 218 = 1102200957967 is a prime.

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

It is a Sophie Germain prime.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21102201220111 is an apocalyptic number.

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

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

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

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

Adding to 1102201220111 its reverse (1110221022011), we get a palindrome (2212422242122).

It can be divided in two parts, 110220 and 1220111, that added together give a palindrome (1330331).

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