Base | Representation |
---|---|
bin | 11110101110111110010… |
… | …001001100110001010011 |
3 | 21110220111101100110200101 |
4 | 132232332101030301103 |
5 | 234100404401402011 |
6 | 4254125450233231 |
7 | 305405565221614 |
oct | 36567621146123 |
9 | 7426441313611 |
10 | 2112021122131 |
11 | 744780954968 |
12 | 2a13a7725817 |
13 | 1242166c271b |
14 | 74318269c0b |
15 | 39e1275b2c1 |
hex | 1ebbe44cc53 |
2112021122131 has 2 divisors, whose sum is σ = 2112021122132. Its totient is φ = 2112021122130.
The previous prime is 2112021122117. The next prime is 2112021122137. The reversal of 2112021122131 is 1312211202112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2112021122131 - 215 = 2112021089363 is a prime.
It is a super-2 number, since 2×21120211221312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2112021122099 and 2112021122108.
It is not a weakly prime, because it can be changed into another prime (2112021122137) 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, 1056010561065 + 1056010561066.
It is an arithmetic number, because the mean of its divisors is an integer number (1056010561066).
Almost surely, 22112021122131 is an apocalyptic number.
2112021122131 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112021122131 is an equidigital number, since it uses as much as digits as its factorization.
2112021122131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 2112021122131 its reverse (1312211202112), we get a palindrome (3424232324243).
The spelling of 2112021122131 in words is "two trillion, one hundred twelve billion, twenty-one million, one hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •