Search a number
-
+
2112012121181 is a prime number
BaseRepresentation
bin11110101110111101101…
…110110111010001011101
321110220110202102011200212
4132232331232313101131
5234100400100334211
64254124525302205
7305405425553024
oct36567556672135
97426422364625
102112012121181
11744776867366
122a13a4704965
13124214890811
1474316da58bb
1539e11a7e38b
hex1ebbdbb745d

2112012121181 has 2 divisors, whose sum is σ = 2112012121182. Its totient is φ = 2112012121180.

The previous prime is 2112012121139. The next prime is 2112012121183. The reversal of 2112012121181 is 1811212102112.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1275015855556 + 836996265625 = 1129166^2 + 914875^2 .

It is a cyclic number.

It is not a de Polignac number, because 2112012121181 - 26 = 2112012121117 is a prime.

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

Together with 2112012121183, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 22112012121181 is an apocalyptic number.

It is an amenable number.

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

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

2112012121181 is an evil number, because the sum of its binary digits is even.

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

Adding to 2112012121181 its reverse (1811212102112), we get a palindrome (3923224223293).

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