Base | Representation |
---|---|
bin | 1100010010011101000… |
… | …0110010110011001111 |
3 | 202011220202200102112121 |
4 | 3010213100302303033 |
5 | 11424324200030221 |
6 | 240552241113411 |
7 | 21152361223663 |
oct | 3044720626317 |
9 | 664822612477 |
10 | 211112111311 |
11 | 81594312972 |
12 | 34ab9028867 |
13 | 16ba553ab7a |
14 | a309c168a3 |
15 | 5758caba41 |
hex | 3127432ccf |
211112111311 has 2 divisors, whose sum is σ = 211112111312. Its totient is φ = 211112111310.
The previous prime is 211112111261. The next prime is 211112111323. The reversal of 211112111311 is 113111211112.
211112111311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a m-pointer prime, because the next prime (211112111323) can be obtained adding 211112111311 to its product of digits (12).
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211112111311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211112111411) 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, 105556055655 + 105556055656.
It is an arithmetic number, because the mean of its divisors is an integer number (105556055656).
Almost surely, 2211112111311 is an apocalyptic number.
211112111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
211112111311 is an equidigital number, since it uses as much as digits as its factorization.
211112111311 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12, while the sum is 16.
Adding to 211112111311 its reverse (113111211112), we get a palindrome (324223322423).
The spelling of 211112111311 in words is "two hundred eleven billion, one hundred twelve million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •