Base | Representation |
---|---|
bin | 1010000110001110111101… |
… | …0110110010001010001111 |
3 | 1110022100202012002122022021 |
4 | 2201203233112302022033 |
5 | 2423344312033020421 |
6 | 35340141352431011 |
7 | 2224052100211564 |
oct | 241435726621217 |
9 | 43270665078267 |
10 | 11102211220111 |
11 | 35a046a888450 |
12 | 12b38240a8467 |
13 | 626c1b09315b |
14 | 2a54c815486b |
15 | 143bd9aca341 |
hex | a18ef5b228f |
11102211220111 has 64 divisors (see below), whose sum is σ = 13349806110720. Its totient is φ = 9126342973440.
The previous prime is 11102211220109. The next prime is 11102211220223.
11102211220111 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 11102211220111 - 21 = 11102211220109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102211227111) 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 63 ways as a sum of consecutive naturals, for example, 73301686 + ... + 73452988.
It is an arithmetic number, because the mean of its divisors is an integer number (208590720480).
Almost surely, 211102211220111 is an apocalyptic number.
11102211220111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11102211220111 is a deficient number, since it is larger than the sum of its proper divisors (2247594890609).
11102211220111 is a wasteful number, since it uses less digits than its factorization.
11102211220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151576.
The product of its (nonzero) digits is 16, while the sum is 16.
It can be divided in two parts, 1110221 and 1220111, that added together give a palindrome (2330332).
The spelling of 11102211220111 in words is "eleven trillion, one hundred two billion, two hundred eleven million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •