Base | Representation |
---|---|
bin | 1010000111011001000011… |
… | …0100111000011011100101 |
3 | 1110101021002021112222121121 |
4 | 2201312100310320123211 |
5 | 2424211030112023302 |
6 | 35353231112413541 |
7 | 2225355003044464 |
oct | 241662064703345 |
9 | 43337067488547 |
10 | 11122100111077 |
11 | 35a894661861a |
12 | 12b76549a72b1 |
13 | 628a6a7379a7 |
14 | 2a64537969db |
15 | 1444a0be9e37 |
hex | a1d90d386e5 |
11122100111077 has 2 divisors, whose sum is σ = 11122100111078. Its totient is φ = 11122100111076.
The previous prime is 11122100111053. The next prime is 11122100111113. The reversal of 11122100111077 is 77011100122111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10891590658081 + 230509452996 = 3300241^2 + 480114^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122100111077 - 227 = 11121965893349 is a prime.
It is a super-2 number, since 2×111221001110772 (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 (11122100111777) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561050055538 + 5561050055539.
It is an arithmetic number, because the mean of its divisors is an integer number (5561050055539).
Almost surely, 211122100111077 is an apocalyptic number.
It is an amenable number.
11122100111077 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122100111077 is an equidigital number, since it uses as much as digits as its factorization.
11122100111077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 196, while the sum is 25.
Adding to 11122100111077 its reverse (77011100122111), we get a palindrome (88133200233188).
The spelling of 11122100111077 in words is "eleven trillion, one hundred twenty-two billion, one hundred million, one hundred eleven thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •