Search a number
-
+
211220120011 is a prime number
BaseRepresentation
bin1100010010110110110…
…0110100000111001011
3202012012021220211121211
43010231230310013023
511430034322320021
6241011100113551
721155142253105
oct3045554640713
9665167824554
10211220120011
118163a28445a
1234b292358b7
1316bc1a26a44
14a31a2d0575
1557634e43e1
hex312db341cb

211220120011 has 2 divisors, whose sum is σ = 211220120012. Its totient is φ = 211220120010.

The previous prime is 211220119969. The next prime is 211220120021. The reversal of 211220120011 is 110021022112.

211220120011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 211220120011 - 211 = 211220117963 is a prime.

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

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

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

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

Almost surely, 2211220120011 is an apocalyptic number.

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

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

211220120011 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 13.

Adding to 211220120011 its reverse (110021022112), we get a palindrome (321241142123).

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