Base | Representation |
---|---|
bin | 11001100000111000101111… |
… | …011110001010010101011101 |
3 | 112201022021111022212222011021 |
4 | 121200320233132022111131 |
5 | 104201431324133323401 |
6 | 1034353023451524141 |
7 | 32430661650513505 |
oct | 3140705736122535 |
9 | 481267438788137 |
10 | 112211112011101 |
11 | 32832513435624 |
12 | 10703322459651 |
13 | 4a7c602039b9c |
14 | 1d9d0925bca05 |
15 | ce8d0647c2a1 |
hex | 660e2f78a55d |
112211112011101 has 2 divisors, whose sum is σ = 112211112011102. Its totient is φ = 112211112011100.
The previous prime is 112211112011099. The next prime is 112211112011107. The reversal of 112211112011101 is 101110211112211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83968540999225 + 28242571011876 = 9163435^2 + 5314374^2 .
It is a cyclic number.
It is not a de Polignac number, because 112211112011101 - 21 = 112211112011099 is a prime.
Together with 112211112011099, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112211112011107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56105556005550 + 56105556005551.
It is an arithmetic number, because the mean of its divisors is an integer number (56105556005551).
Almost surely, 2112211112011101 is an apocalyptic number.
It is an amenable number.
112211112011101 is a deficient number, since it is larger than the sum of its proper divisors (1).
112211112011101 is an equidigital number, since it uses as much as digits as its factorization.
112211112011101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 112211112011101 its reverse (101110211112211), we get a palindrome (213321323123312).
The spelling of 112211112011101 in words is "one hundred twelve trillion, two hundred eleven billion, one hundred twelve million, eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •