Base | Representation |
---|---|
bin | 11110101110000010001… |
… | …000100000100110110111 |
3 | 21110210220001220110222011 |
4 | 132232002020200212313 |
5 | 234041323111224002 |
6 | 4253441405545051 |
7 | 305341564505251 |
oct | 36560210404667 |
9 | 7423801813864 |
10 | 2111012211127 |
11 | 7443033a5116 |
12 | 2a1165875187 |
13 | 1240b5685571 |
14 | 7426027ccd1 |
15 | 39da3db98d7 |
hex | 1eb822209b7 |
2111012211127 has 2 divisors, whose sum is σ = 2111012211128. Its totient is φ = 2111012211126.
The previous prime is 2111012211059. The next prime is 2111012211137. The reversal of 2111012211127 is 7211122101112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2111012211127 - 27 = 2111012210999 is a prime.
It is a super-2 number, since 2×21110122111272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2111012211098 and 2111012211107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111012211137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055506105563 + 1055506105564.
It is an arithmetic number, because the mean of its divisors is an integer number (1055506105564).
Almost surely, 22111012211127 is an apocalyptic number.
2111012211127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111012211127 is an equidigital number, since it uses as much as digits as its factorization.
2111012211127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 2111012211127 its reverse (7211122101112), we get a palindrome (9322134312239).
The spelling of 2111012211127 in words is "two trillion, one hundred eleven billion, twelve million, two hundred eleven thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •