Base | Representation |
---|---|
bin | 1010000110001111000000… |
… | …0000010100111000000011 |
3 | 1110022100202221120220201022 |
4 | 2201203300000110320003 |
5 | 2423344322330011321 |
6 | 35340142422100055 |
7 | 2224052261606261 |
oct | 241436000247003 |
9 | 43270687526638 |
10 | 11102222110211 |
11 | 35a0475a46331 |
12 | 12b382787a62b |
13 | 626c20406bbb |
14 | 2a54c978b431 |
15 | 143bdaa2bdab |
hex | a18f0014e03 |
11102222110211 has 8 divisors (see below), whose sum is σ = 11286164649648. Its totient is φ = 10918342116000.
The previous prime is 11102222110129. The next prime is 11102222110219. The reversal of 11102222110211 is 11201122220111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102222110211 is a prime.
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 11102222110211.
It is not an unprimeable number, because it can be changed into a prime (11102222110219) 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, 15278285 + ... + 15988446.
It is an arithmetic number, because the mean of its divisors is an integer number (1410770581206).
Almost surely, 211102222110211 is an apocalyptic number.
11102222110211 is a deficient number, since it is larger than the sum of its proper divisors (183942539437).
11102222110211 is an equidigital number, since it uses as much as digits as its factorization.
11102222110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31272613.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11102222110211 its reverse (11201122220111), we get a palindrome (22303344330322).
The spelling of 11102222110211 in words is "eleven trillion, one hundred two billion, two hundred twenty-two million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •