Search a number
-
+
20102211110011 is a prime number
BaseRepresentation
bin1001001001000011010010…
…01001110000010001111011
32122011202022122200212121211
410210201221021300101323
510113323312021010021
6110430454524543551
74143223350101152
oct444415111602173
978152278625554
1020102211110011
116450333120888
122307b399b1bb7
13b2a826c149a4
144d6d48c0c599
1524cd882843e1
hex12486927047b

20102211110011 has 2 divisors, whose sum is σ = 20102211110012. Its totient is φ = 20102211110010.

The previous prime is 20102211109957. The next prime is 20102211110027. The reversal of 20102211110011 is 11001111220102.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

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

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

Almost surely, 220102211110011 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 13.

Adding to 20102211110011 its reverse (11001111220102), we get a palindrome (31103322330113).

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