Search a number
-
+
20202022021211 is a prime number
BaseRepresentation
bin1001001011111101001100…
…10110001010100001011011
32122112021221122112111210122
410211332212112022201123
510121442220114134321
6110544403015103455
74153355636615312
oct445764626124133
978467848474718
1020202022021211
1164896a1846748
122323354371b8b
13b370724ba664
144dbad6acb279
1525077aabc8ab
hex125fa658a85b

20202022021211 has 2 divisors, whose sum is σ = 20202022021212. Its totient is φ = 20202022021210.

The previous prime is 20202022021193. The next prime is 20202022021241. The reversal of 20202022021211 is 11212022020202.

It is a happy number.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 20202022021211 - 230 = 20200948279387 is a prime.

It is a super-3 number, since 3×202020220212113 (a number of 41 digits) contains 333 as substring.

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

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

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

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

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

Almost surely, 220202022021211 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 128, while the sum is 17.

Adding to 20202022021211 its reverse (11212022020202), we get a palindrome (31414044041413).

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