Search a number
-
+
20112200101031 is a prime number
BaseRepresentation
bin1001001001010101111001…
…00010101110110010100111
32122012201002210202012021012
410210222330202232302213
510114004241211213111
6110435230035412435
74144026032112023
oct444527442566247
978181083665235
1020112200101031
1164545996a6665
122309a6715411b
13b2b75954926c
144d7615707383
1524d2701ba48b
hex124abc8aeca7

20112200101031 has 2 divisors, whose sum is σ = 20112200101032. Its totient is φ = 20112200101030.

The previous prime is 20112200100943. The next prime is 20112200101057. The reversal of 20112200101031 is 13010100221102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 20112200101031 - 238 = 19837322194087 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 220112200101031 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 24, while the sum is 14.

Adding to 20112200101031 its reverse (13010100221102), we get a palindrome (33122300322133).

The spelling of 20112200101031 in words is "twenty trillion, one hundred twelve billion, two hundred million, one hundred one thousand, thirty-one".