Base | Representation |
---|---|
bin | 10000010100000001011… |
… | …101111111000110011111 |
3 | 10222011112012011100022211 |
4 | 100110001131333012133 |
5 | 121331312320231421 |
6 | 2214552502221251 |
7 | 143663462102005 |
oct | 20240135770637 |
9 | 3864465140284 |
10 | 1121011102111 |
11 | 3a24665a6a9a |
12 | 161314424827 |
13 | 81931aa9484 |
14 | 3c385b8aa75 |
15 | 1e2603929e1 |
hex | 1050177f19f |
1121011102111 has 2 divisors, whose sum is σ = 1121011102112. Its totient is φ = 1121011102110.
The previous prime is 1121011102097. The next prime is 1121011102121. The reversal of 1121011102111 is 1112011101211.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1121011102111 - 27 = 1121011101983 is a prime.
It is a super-2 number, since 2×11210111021112 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1121011102091 and 1121011102100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1121011102121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560505551055 + 560505551056.
It is an arithmetic number, because the mean of its divisors is an integer number (560505551056).
Almost surely, 21121011102111 is an apocalyptic number.
1121011102111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121011102111 is an equidigital number, since it uses as much as digits as its factorization.
1121011102111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 1121011102111 its reverse (1112011101211), we get a palindrome (2233022203322).
The spelling of 1121011102111 in words is "one trillion, one hundred twenty-one billion, eleven million, one hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •