Base | Representation |
---|---|
bin | 1010000111011001011110… |
… | …0000011110011010001001 |
3 | 1110101021101002110210121202 |
4 | 2201312113200132122021 |
5 | 2424211242310431441 |
6 | 35353250155113545 |
7 | 2225360533565516 |
oct | 241662740363211 |
9 | 43337332423552 |
10 | 11122212202121 |
11 | 35a89a3918249 |
12 | 12b76864428b5 |
13 | 628a87a22a57 |
14 | 2a646461430d |
15 | 1444aa98c19b |
hex | a1d9781e689 |
11122212202121 has 8 divisors (see below), whose sum is σ = 11187879563520. Its totient is φ = 11056584086608.
The previous prime is 11122212202069. The next prime is 11122212202147. The reversal of 11122212202121 is 12120221222111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11122212202121 - 210 = 11122212201097 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11122212202093 and 11122212202102.
It is not an unprimeable number, because it can be changed into a prime (11122212207121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9242906 + ... + 10376691.
It is an arithmetic number, because the mean of its divisors is an integer number (1398484945440).
Almost surely, 211122212202121 is an apocalyptic number.
It is an amenable number.
11122212202121 is a deficient number, since it is larger than the sum of its proper divisors (65667361399).
11122212202121 is a wasteful number, since it uses less digits than its factorization.
11122212202121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19622943.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 11122212202121 its reverse (12120221222111), we get a palindrome (23242433424232).
The spelling of 11122212202121 in words is "eleven trillion, one hundred twenty-two billion, two hundred twelve million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •