Base | Representation |
---|---|
bin | 1010000110000111100010… |
… | …1010111101110101010101 |
3 | 1110022011121102022022010211 |
4 | 2201201320222331311111 |
5 | 2423331222311201401 |
6 | 35335212022245421 |
7 | 2223651541256560 |
oct | 241417052756525 |
9 | 43264542268124 |
10 | 11100220022101 |
11 | 359a638902961 |
12 | 12b3369286871 |
13 | 6269916ab292 |
14 | 2a537990b4d7 |
15 | 143b1eda5951 |
hex | a1878abdd55 |
11100220022101 has 16 divisors (see below), whose sum is σ = 12892874134144. Its totient is φ = 9359680486464.
The previous prime is 11100220022083. The next prime is 11100220022137. The reversal of 11100220022101 is 10122002200111.
It is not a de Polignac number, because 11100220022101 - 27 = 11100220021973 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100220022701) 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 15 ways as a sum of consecutive naturals, for example, 15800730 + ... + 16488283.
It is an arithmetic number, because the mean of its divisors is an integer number (805804633384).
Almost surely, 211100220022101 is an apocalyptic number.
It is an amenable number.
11100220022101 is a deficient number, since it is larger than the sum of its proper divisors (1792654112043).
11100220022101 is an equidigital number, since it uses as much as digits as its factorization.
11100220022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32289820.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11100220022101 its reverse (10122002200111), we get a palindrome (21222222222212).
The spelling of 11100220022101 in words is "eleven trillion, one hundred billion, two hundred twenty million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •