Base | Representation |
---|---|
bin | 11001010010010110010110… |
… | …011100010110110000111111 |
3 | 112120202202220022111222000012 |
4 | 121102112112130112300333 |
5 | 104034044401211223012 |
6 | 1032310050011053435 |
7 | 32265544546360253 |
oct | 3122262634266077 |
9 | 476682808458005 |
10 | 111212112211007 |
11 | 3248787905a725 |
12 | 1058179b44127b |
13 | 4a0934604b512 |
14 | 1d669a2d36263 |
15 | cccd37936622 |
hex | 652596716c3f |
111212112211007 has 2 divisors, whose sum is σ = 111212112211008. Its totient is φ = 111212112211006.
The previous prime is 111212112210989. The next prime is 111212112211127. The reversal of 111212112211007 is 700112211212111.
It is a weak prime.
It is an emirp because it is prime and its reverse (700112211212111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111212112211007 - 28 = 111212112210751 is a prime.
It is a super-2 number, since 2×1112121122110072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111212112231007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55606056105503 + 55606056105504.
It is an arithmetic number, because the mean of its divisors is an integer number (55606056105504).
Almost surely, 2111212112211007 is an apocalyptic number.
111212112211007 is a deficient number, since it is larger than the sum of its proper divisors (1).
111212112211007 is an equidigital number, since it uses as much as digits as its factorization.
111212112211007 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 23.
Adding to 111212112211007 its reverse (700112211212111), we get a palindrome (811324323423118).
The spelling of 111212112211007 in words is "one hundred eleven trillion, two hundred twelve billion, one hundred twelve million, two hundred eleven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •