Base | Representation |
---|---|
bin | 1010000111011000101110… |
… | …0001110010100010000101 |
3 | 1110101020212002021212010020 |
4 | 2201312023201302202011 |
5 | 2424210334333020401 |
6 | 35353214215245353 |
7 | 2225352543351225 |
oct | 241661341624205 |
9 | 43336762255106 |
10 | 11122011220101 |
11 | 35a8900424501 |
12 | 12b762b079859 |
13 | 628a551b3792 |
14 | 2a6445a58085 |
15 | 144497edbd36 |
hex | a1d8b872885 |
11122011220101 has 8 divisors (see below), whose sum is σ = 14834608804320. Its totient is φ = 7412043891312.
The previous prime is 11122011220093. The next prime is 11122011220141. The reversal of 11122011220101 is 10102211022111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11122011220101 - 23 = 11122011220093 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11122011220141) 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 in 7 ways as a sum of consecutive naturals, for example, 657553990 + ... + 657570903.
It is an arithmetic number, because the mean of its divisors is an integer number (1854326100540).
Almost surely, 211122011220101 is an apocalyptic number.
It is an amenable number.
11122011220101 is a deficient number, since it is larger than the sum of its proper divisors (3712597584219).
11122011220101 is a wasteful number, since it uses less digits than its factorization.
11122011220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1315127715.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11122011220101 its reverse (10102211022111), we get a palindrome (21224222242212).
The spelling of 11122011220101 in words is "eleven trillion, one hundred twenty-two billion, eleven million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •