Base | Representation |
---|---|
bin | 1010001100000011100001… |
… | …0110011101101111110101 |
3 | 1110122220212222111012101101 |
4 | 2203000320112131233311 |
5 | 2432014121322333302 |
6 | 35454121234330101 |
7 | 2234222312641456 |
oct | 243007026355765 |
9 | 43586788435341 |
10 | 11202220121077 |
11 | 3629920242a17 |
12 | 130b094a29931 |
13 | 63349869b12b |
14 | 2aa29445112d |
15 | 1465de9c2287 |
hex | a303859dbf5 |
11202220121077 has 2 divisors, whose sum is σ = 11202220121078. Its totient is φ = 11202220121076.
The previous prime is 11202220121033. The next prime is 11202220121119. The reversal of 11202220121077 is 77012102220211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6702501588561 + 4499718532516 = 2588919^2 + 2121254^2 .
It is a cyclic number.
It is not a de Polignac number, because 11202220121077 - 223 = 11202211732469 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11202220121017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5601110060538 + 5601110060539.
It is an arithmetic number, because the mean of its divisors is an integer number (5601110060539).
Almost surely, 211202220121077 is an apocalyptic number.
It is an amenable number.
11202220121077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11202220121077 is an equidigital number, since it uses as much as digits as its factorization.
11202220121077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1568, while the sum is 28.
Adding to 11202220121077 its reverse (77012102220211), we get a palindrome (88214322341288).
The spelling of 11202220121077 in words is "eleven trillion, two hundred two billion, two hundred twenty million, one hundred twenty-one thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •