Base | Representation |
---|---|
bin | 1010000110001110111101… |
… | …1001110101101111011011 |
3 | 1110022100202020121100012122 |
4 | 2201203233121311233123 |
5 | 2423344312234134321 |
6 | 35340141421531455 |
7 | 2224052110056263 |
oct | 241435731655733 |
9 | 43270666540178 |
10 | 11102212021211 |
11 | 35a0470285313 |
12 | 12b3824413b8b |
13 | 626c1b2b398c |
14 | 2a54c82c27a3 |
15 | 143bd9bd78ab |
hex | a18ef675bdb |
11102212021211 has 32 divisors (see below), whose sum is σ = 11502231552000. Its totient is φ = 10711492789536.
The previous prime is 11102212021183. The next prime is 11102212021249. The reversal of 11102212021211 is 11212021220111.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102212021211 is a prime.
It is a super-2 number, since 2×111022120212112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11102212021211.
It is not an unprimeable number, because it can be changed into a prime (11102212021261) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1058659010 + ... + 1058669496.
It is an arithmetic number, because the mean of its divisors is an integer number (359444736000).
Almost surely, 211102212021211 is an apocalyptic number.
11102212021211 is a deficient number, since it is larger than the sum of its proper divisors (400019530789).
11102212021211 is a wasteful number, since it uses less digits than its factorization.
11102212021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12263.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11102212021211 its reverse (11212021220111), we get a palindrome (22314233241322).
The spelling of 11102212021211 in words is "eleven trillion, one hundred two billion, two hundred twelve million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •