Search a number
-
+
2112012102113 is a prime number
BaseRepresentation
bin11110101110111101101…
…110110010100111100001
321110220110202101012112122
4132232331232302213201
5234100400044231423
64254124525034025
7305405425443314
oct36567556624741
97426422335478
102112012102113
11744776854001
122a13a46b5915
13124214884c34
1474316d9c97b
1539e11a788c8
hex1ebbdbb29e1

2112012102113 has 2 divisors, whose sum is σ = 2112012102114. Its totient is φ = 2112012102112.

The previous prime is 2112012102107. The next prime is 2112012102121. The reversal of 2112012102113 is 3112012102112.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1908423442849 + 203588659264 = 1381457^2 + 451208^2 .

It is a cyclic number.

It is not a de Polignac number, because 2112012102113 - 224 = 2111995324897 is a prime.

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

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

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

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

Almost surely, 22112012102113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 2112012102113 its reverse (3112012102112), we get a palindrome (5224024204225).

Subtracting 2112012102113 from its reverse (3112012102112), we obtain a palindrome (999999999999).

The spelling of 2112012102113 in words is "two trillion, one hundred twelve billion, twelve million, one hundred two thousand, one hundred thirteen".