Base | Representation |
---|---|
bin | 1010000111011001011011… |
… | …0110101000001011000101 |
3 | 1110101021100022211110112112 |
4 | 2201312112312220023011 |
5 | 2424211232003411234 |
6 | 35353245124030405 |
7 | 2225360341416044 |
oct | 241662666501305 |
9 | 43337308743475 |
10 | 11122201232069 |
11 | 35a8998705294 |
12 | 12b7682832405 |
13 | 628a856817b5 |
14 | 2a6462d9a55b |
15 | 1444a9a21ace |
hex | a1d96da82c5 |
11122201232069 has 2 divisors, whose sum is σ = 11122201232070. Its totient is φ = 11122201232068.
The previous prime is 11122201232029. The next prime is 11122201232159. The reversal of 11122201232069 is 96023210222111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10203948587044 + 918252645025 = 3194362^2 + 958255^2 .
It is an emirp because it is prime and its reverse (96023210222111) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11122201232069 is a prime.
It is a super-2 number, since 2×111222012320692 (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 (11122201232029) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561100616034 + 5561100616035.
It is an arithmetic number, because the mean of its divisors is an integer number (5561100616035).
Almost surely, 211122201232069 is an apocalyptic number.
It is an amenable number.
11122201232069 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122201232069 is an equidigital number, since it uses as much as digits as its factorization.
11122201232069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 11122201232069 in words is "eleven trillion, one hundred twenty-two billion, two hundred one million, two hundred thirty-two thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •