Base | Representation |
---|---|
bin | 1010000111010010000001… |
… | …0010110001100110110101 |
3 | 1110101002012200222012112121 |
4 | 2201310200102301212311 |
5 | 2424143143300401122 |
6 | 35352315510315541 |
7 | 2225260136311324 |
oct | 241644022614665 |
9 | 43332180865477 |
10 | 11120212122037 |
11 | 35a80679264a7 |
12 | 12b7208658bb1 |
13 | 62882954b105 |
14 | 2a6314b380bb |
15 | 1443e00b0bc7 |
hex | a1d204b19b5 |
11120212122037 has 2 divisors, whose sum is σ = 11120212122038. Its totient is φ = 11120212122036.
The previous prime is 11120212122007. The next prime is 11120212122049. The reversal of 11120212122037 is 73022121202111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7522699504516 + 3597512617521 = 2742754^2 + 1896711^2 .
It is a cyclic number.
It is not a de Polignac number, because 11120212122037 - 219 = 11120211597749 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11120212122007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5560106061018 + 5560106061019.
It is an arithmetic number, because the mean of its divisors is an integer number (5560106061019).
Almost surely, 211120212122037 is an apocalyptic number.
It is an amenable number.
11120212122037 is a deficient number, since it is larger than the sum of its proper divisors (1).
11120212122037 is an equidigital number, since it uses as much as digits as its factorization.
11120212122037 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 11120212122037 its reverse (73022121202111), we get a palindrome (84142333324148).
The spelling of 11120212122037 in words is "eleven trillion, one hundred twenty billion, two hundred twelve million, one hundred twenty-two thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •