Base | Representation |
---|---|
bin | 1010000111010010000011… |
… | …1001010000100001011001 |
3 | 1110101002020101221201210221 |
4 | 2201310200321100201121 |
5 | 2424143203341211022 |
6 | 35352320510440041 |
7 | 2225260321125565 |
oct | 241644071204131 |
9 | 43332211851727 |
10 | 11120222210137 |
11 | 35a8072596877 |
12 | 12b720bb03021 |
13 | 62882b670ac1 |
14 | 2a63162026a5 |
15 | 1443e0e04cc7 |
hex | a1d20e50859 |
11120222210137 has 2 divisors, whose sum is σ = 11120222210138. Its totient is φ = 11120222210136.
The previous prime is 11120222210099. The next prime is 11120222210231. The reversal of 11120222210137 is 73101222202111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9945565088281 + 1174657121856 = 3153659^2 + 1083816^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120222210137 - 223 = 11120213821529 is a prime.
It is not a weakly prime, because it can be changed into another prime (11120222216137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560111105068 + 5560111105069.
It is an arithmetic number, because the mean of its divisors is an integer number (5560111105069).
Almost surely, 211120222210137 is an apocalyptic number.
It is an amenable number.
11120222210137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120222210137 is an equidigital number, since it uses as much as digits as its factorization.
11120222210137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 25.
Adding to 11120222210137 its reverse (73101222202111), we get a palindrome (84221444412248).
The spelling of 11120222210137 in words is "eleven trillion, one hundred twenty billion, two hundred twenty-two million, two hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •