Search a number
-
+
20012211020119 is a prime number
BaseRepresentation
bin1001000110011011101001…
…01110101010000101010111
32121212011000101122121012011
410203031310232222011113
510110340002010120434
6110321252142405051
74133556150001423
oct443156456520527
977764011577164
1020012211020119
1164161494491aa
1222b2600b90787
13b221b3090826
144d284bcc9b83
1524a86bddae64
hex123374baa157

20012211020119 has 2 divisors, whose sum is σ = 20012211020120. Its totient is φ = 20012211020118.

The previous prime is 20012211020093. The next prime is 20012211020143. The reversal of 20012211020119 is 91102011221002.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20012211020119 - 29 = 20012211019607 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 220012211020119 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 144, while the sum is 22.

The spelling of 20012211020119 in words is "twenty trillion, twelve billion, two hundred eleven million, twenty thousand, one hundred nineteen".