Search a number
-
+
102211110011089 is a prime number
BaseRepresentation
bin10111001111010111100000…
…111001111000000011010001
3111101220021201222220002211101
4113033113200321320003101
5101344111323130323324
61001215045151544401
730346336406136232
oct2717274071700321
9441807658802741
10102211110011089
112a627540a65a02
12b569245b2b101
13450560a661231
141b350890cd089
15bc3b2b291944
hex5cf5e0e780d1

102211110011089 has 2 divisors, whose sum is σ = 102211110011090. Its totient is φ = 102211110011088.

The previous prime is 102211110010913. The next prime is 102211110011117. The reversal of 102211110011089 is 980110011112201.

It is an a-pointer prime, because the next prime (102211110011117) can be obtained adding 102211110011089 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62419085330625 + 39792024680464 = 7900575^2 + 6308092^2 .

It is a cyclic number.

It is not a de Polignac number, because 102211110011089 - 215 = 102211109978321 is a prime.

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

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

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

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

Almost surely, 2102211110011089 is an apocalyptic number.

It is an amenable number.

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

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

102211110011089 is an evil number, because the sum of its binary digits is even.

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

The spelling of 102211110011089 in words is "one hundred two trillion, two hundred eleven billion, one hundred ten million, eleven thousand, eighty-nine".