Base | Representation |
---|---|
bin | 11001000010001010110100… |
… | …100000100011111001110011 |
3 | 112102211110220122100101002110 |
4 | 121002022310200203321303 |
5 | 103412340222321201321 |
6 | 1030055202020220403 |
7 | 32122323043356615 |
oct | 3102126440437163 |
9 | 472743818311073 |
10 | 110100220100211 |
11 | 32099271a378a0 |
12 | 104221b0b3a703 |
13 | 49585385850c3 |
14 | 1d28c442d6db5 |
15 | cade5ce27176 |
hex | 6422b4823e73 |
110100220100211 has 16 divisors (see below), whose sum is σ = 161731376425728. Its totient is φ = 66066738732000.
The previous prime is 110100220100093. The next prime is 110100220100243. The reversal of 110100220100211 is 112001022001011.
It is not a de Polignac number, because 110100220100211 - 222 = 110100215905907 is a prime.
It is a super-2 number, since 2×1101002201002112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110100220100411) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16516681351 + ... + 16516688016.
It is an arithmetic number, because the mean of its divisors is an integer number (10108211026608).
Almost surely, 2110100220100211 is an apocalyptic number.
110100220100211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110100220100211 is a deficient number, since it is larger than the sum of its proper divisors (51631156325517).
110100220100211 is a wasteful number, since it uses less digits than its factorization.
110100220100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33033369482.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110100220100211 its reverse (112001022001011), we get a palindrome (222101242101222).
The spelling of 110100220100211 in words is "one hundred ten trillion, one hundred billion, two hundred twenty million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •