Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …001110100010001100001011 |
3 | 112102211122210102210012022210 |
4 | 121002030211032202030023 |
5 | 103412403110431400021 |
6 | 1030100113413120203 |
7 | 32122420645430250 |
oct | 3102144516421413 |
9 | 472748712705283 |
10 | 110102111200011 |
11 | 3209a052464097 |
12 | 1042263a329063 |
13 | 495877a2c0878 |
14 | 1d28d83525427 |
15 | cae01de77e76 |
hex | 6423253a230b |
110102111200011 has 32 divisors (see below), whose sum is σ = 167846588633088. Its totient is φ = 62888519342880.
The previous prime is 110102111199953. The next prime is 110102111200013. The reversal of 110102111200011 is 110002111201011.
It is not a de Polignac number, because 110102111200011 - 229 = 110101574329099 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110102111200011.
It is not an unprimeable number, because it can be changed into a prime (110102111200013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 469756096 + ... + 469990418.
It is an arithmetic number, because the mean of its divisors is an integer number (5245205894784).
Almost surely, 2110102111200011 is an apocalyptic number.
110102111200011 is a deficient number, since it is larger than the sum of its proper divisors (57744477433077).
110102111200011 is a wasteful number, since it uses less digits than its factorization.
110102111200011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 243831.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 110102111200011 its reverse (110002111201011), we get a palindrome (220104222401022).
The spelling of 110102111200011 in words is "one hundred ten trillion, one hundred two billion, one hundred eleven million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •