Base | Representation |
---|---|
bin | 1010000111010001010011… |
… | …1110010010101011011101 |
3 | 1110101001201110121022201221 |
4 | 2201310110332102223131 |
5 | 2424142301140444401 |
6 | 35352245003533341 |
7 | 2225252342111650 |
oct | 241642476225335 |
9 | 43331643538657 |
10 | 11120022203101 |
11 | 35a7a7a6a95a9 |
12 | 12b7174b2a251 |
13 | 6287c90b3546 |
14 | 2a62d781b897 |
15 | 1443cd5987a1 |
hex | a1d14f92add |
11120022203101 has 8 divisors (see below), whose sum is σ = 13377470319680. Its totient is φ = 9029792465568.
The previous prime is 11120022203077. The next prime is 11120022203131. The reversal of 11120022203101 is 10130222002111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11120022203101 - 29 = 11120022202589 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120022203131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41804594616 + ... + 41804594881.
It is an arithmetic number, because the mean of its divisors is an integer number (1672183789960).
Almost surely, 211120022203101 is an apocalyptic number.
It is an amenable number.
11120022203101 is a deficient number, since it is larger than the sum of its proper divisors (2257448116579).
11120022203101 is an equidigital number, since it uses as much as digits as its factorization.
11120022203101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83609189523.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 11120022203101 its reverse (10130222002111), we get a palindrome (21250244205212).
The spelling of 11120022203101 in words is "eleven trillion, one hundred twenty billion, twenty-two million, two hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •