Base | Representation |
---|---|
bin | 1010000111011001000110… |
… | …0010010011111011010001 |
3 | 1110101021010002222000211101 |
4 | 2201312101202103323101 |
5 | 2424211041134121202 |
6 | 35353232215544401 |
7 | 2225355206215054 |
oct | 241662142237321 |
9 | 43337102860741 |
10 | 11122112020177 |
11 | 35a8952312054 |
12 | 12b765898b101 |
13 | 628a700474b2 |
14 | 2a64551b6a9b |
15 | 1444a1c9d887 |
hex | a1d91893ed1 |
11122112020177 has 2 divisors, whose sum is σ = 11122112020178. Its totient is φ = 11122112020176.
The previous prime is 11122112020153. The next prime is 11122112020213. The reversal of 11122112020177 is 77102021122111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7317587650816 + 3804524369361 = 2705104^2 + 1950519^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11122112020177 is a prime.
It is a super-2 number, since 2×111221120201772 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11122112023177) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561056010088 + 5561056010089.
It is an arithmetic number, because the mean of its divisors is an integer number (5561056010089).
Almost surely, 211122112020177 is an apocalyptic number.
It is an amenable number.
11122112020177 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122112020177 is an equidigital number, since it uses as much as digits as its factorization.
11122112020177 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 784, while the sum is 28.
Adding to 11122112020177 its reverse (77102021122111), we get a palindrome (88224133142288).
The spelling of 11122112020177 in words is "eleven trillion, one hundred twenty-two billion, one hundred twelve million, twenty thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •