Search a number
-
+
211211102200099 is a prime number
BaseRepresentation
bin110000000001100001101010…
…101110000010000100100011
31000200211120202212022121210111
4300001201222232002010203
5210140440314130400344
62025113012453512151
762326333002555361
oct6001415256020443
91020746685277714
10211211102200099
1161331141a25741
121b832162942657
1390b1176b60771
143a22959952631
1519641436e8834
hexc0186ab82123

211211102200099 has 2 divisors, whose sum is σ = 211211102200100. Its totient is φ = 211211102200098.

The previous prime is 211211102200097. The next prime is 211211102200117. The reversal of 211211102200099 is 990002201112112.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 211211102200099 - 21 = 211211102200097 is a prime.

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

Together with 211211102200097, it forms a pair of twin primes.

It is a self number, because there is not a number n which added to its sum of digits gives 211211102200099.

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

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

Almost surely, 2211211102200099 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1296, while the sum is 31.

The spelling of 211211102200099 in words is "two hundred eleven trillion, two hundred eleven billion, one hundred two million, two hundred thousand, ninety-nine".