Search a number
-
+
2120022110131 is a prime number
BaseRepresentation
bin11110110110011011001…
…010100010111110110011
321111200010222121202212021
4132312123022202332303
5234213301130011011
64301531423212311
7306111060415342
oct36663312427663
97450128552767
102120022110131
11748107237642
122a2a5b147097
13124bc01c0453
1474876b0db59
153a22ed9e471
hex1ed9b2a2fb3

2120022110131 has 2 divisors, whose sum is σ = 2120022110132. Its totient is φ = 2120022110130.

The previous prime is 2120022110113. The next prime is 2120022110147. The reversal of 2120022110131 is 1310112200212.

Together with previous prime (2120022110113) it forms an Ormiston pair, because they use the same digits, order apart.

It is an a-pointer prime, because the next prime (2120022110147) can be obtained adding 2120022110131 to its sum of digits (16).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2120022110131 - 223 = 2120013721523 is a prime.

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

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

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

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

Almost surely, 22120022110131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 2120022110131 its reverse (1310112200212), we get a palindrome (3430134310343).

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