Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1101111110101011011101 |
3 | 1110101001201110110011100212 |
4 | 2201310110331332223131 |
5 | 2424142301130334211 |
6 | 35352245002102205 |
7 | 2225252341321061 |
oct | 241642475765335 |
9 | 43331643404325 |
10 | 11120022121181 |
11 | 35a7a7a652aa6 |
12 | 12b7174aaa965 |
13 | 6287c908517c |
14 | 2a62d77d9aa1 |
15 | 1443cd57e38b |
hex | a1d14f7eadd |
11120022121181 has 2 divisors, whose sum is σ = 11120022121182. Its totient is φ = 11120022121180.
The previous prime is 11120022121163. The next prime is 11120022121193. The reversal of 11120022121181 is 18112122002111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10988336597956 + 131685523225 = 3314866^2 + 362885^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11120022121181 is a prime.
It is a super-2 number, since 2×111200221211812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120022181181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560011060590 + 5560011060591.
It is an arithmetic number, because the mean of its divisors is an integer number (5560011060591).
Almost surely, 211120022121181 is an apocalyptic number.
It is an amenable number.
11120022121181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120022121181 is an equidigital number, since it uses as much as digits as its factorization.
11120022121181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 23.
Adding to 11120022121181 its reverse (18112122002111), we get a palindrome (29232144123292).
The spelling of 11120022121181 in words is "eleven trillion, one hundred twenty billion, twenty-two million, one hundred twenty-one thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •