Base | Representation |
---|---|
bin | 11001100000110111110100… |
… | …011101111111110011010011 |
3 | 112201022011221100012220011102 |
4 | 121200313310131333303103 |
5 | 104201422312230042321 |
6 | 1034352341330535015 |
7 | 32430625300513064 |
oct | 3140676435776323 |
9 | 481264840186142 |
10 | 112210122112211 |
11 | 32832055690972 |
12 | 107030a6a3746b |
13 | 4a7c4a4c285b6 |
14 | 1d9cddad4056b |
15 | ce8c995e3c0b |
hex | 660df477fcd3 |
112210122112211 has 2 divisors, whose sum is σ = 112210122112212. Its totient is φ = 112210122112210.
The previous prime is 112210122112159. The next prime is 112210122112279. The reversal of 112210122112211 is 112211221012211.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112210122112211 is a prime.
It is a super-2 number, since 2×1122101221122112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112210122112411) 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, 56105061056105 + 56105061056106.
It is an arithmetic number, because the mean of its divisors is an integer number (56105061056106).
Almost surely, 2112210122112211 is an apocalyptic number.
112210122112211 is a deficient number, since it is larger than the sum of its proper divisors (1).
112210122112211 is an equidigital number, since it uses as much as digits as its factorization.
112210122112211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 112210122112211 its reverse (112211221012211), we get a palindrome (224421343124422).
The spelling of 112210122112211 in words is "one hundred twelve trillion, two hundred ten billion, one hundred twenty-two million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •