Base | Representation |
---|---|
bin | 11001011111011011101100… |
… | …111010110100011010001111 |
3 | 112200221201122001220001111122 |
4 | 121133123230322310122033 |
5 | 104143312230031432231 |
6 | 1034235102430511155 |
7 | 32420524216611035 |
oct | 3137335472643217 |
9 | 480851561801448 |
10 | 112111211202191 |
11 | 327a4108a99233 |
12 | 106a7aa19654bb |
13 | 4a73070c499c6 |
14 | 1d982d67bc555 |
15 | ce640acd777b |
hex | 65f6eceb468f |
112111211202191 has 2 divisors, whose sum is σ = 112111211202192. Its totient is φ = 112111211202190.
The previous prime is 112111211202169. The next prime is 112111211202239. The reversal of 112111211202191 is 191202112111211.
It is a weak prime.
It is an emirp because it is prime and its reverse (191202112111211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112111211202191 - 214 = 112111211185807 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112111211202191.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112111211202161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56055605601095 + 56055605601096.
It is an arithmetic number, because the mean of its divisors is an integer number (56055605601096).
Almost surely, 2112111211202191 is an apocalyptic number.
112111211202191 is a deficient number, since it is larger than the sum of its proper divisors (1).
112111211202191 is an equidigital number, since it uses as much as digits as its factorization.
112111211202191 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 26.
The spelling of 112111211202191 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred eleven million, two hundred two thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •