Base | Representation |
---|---|
bin | 1100010111010010110… |
… | …0001010010011100111 |
3 | 202022021022000110201001 |
4 | 3011310230022103213 |
5 | 11440004222143421 |
6 | 241325203414131 |
7 | 21226513552504 |
oct | 3056454122347 |
9 | 668238013631 |
10 | 212411131111 |
11 | 820a0600753 |
12 | 35200084347 |
13 | 170516c193a |
14 | a3d05604ab |
15 | 57d2d56691 |
hex | 3174b0a4e7 |
212411131111 has 2 divisors, whose sum is σ = 212411131112. Its totient is φ = 212411131110.
The previous prime is 212411131103. The next prime is 212411131159. The reversal of 212411131111 is 111131114212.
212411131111 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 (212411131159) can be obtained adding 212411131111 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212411131111 - 23 = 212411131103 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212411131811) 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, 106205565555 + 106205565556.
It is an arithmetic number, because the mean of its divisors is an integer number (106205565556).
Almost surely, 2212411131111 is an apocalyptic number.
212411131111 is a deficient number, since it is larger than the sum of its proper divisors (1).
212411131111 is an equidigital number, since it uses as much as digits as its factorization.
212411131111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 19.
Adding to 212411131111 its reverse (111131114212), we get a palindrome (323542245323).
The spelling of 212411131111 in words is "two hundred twelve billion, four hundred eleven million, one hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •