Base | Representation |
---|---|
bin | 11001011101110101001100… |
… | …001110101100111010110011 |
3 | 112200120012112002120112021221 |
4 | 121131311030032230322303 |
5 | 104140011314110201321 |
6 | 1034112340334325511 |
7 | 32406546454310446 |
oct | 3135651416547263 |
9 | 480505462515257 |
10 | 112001141100211 |
11 | 32761465318500 |
12 | 1068a6a3659897 |
13 | 4a6587c076a4c |
14 | 1d92c5418b65d |
15 | ce3617993e41 |
hex | 65dd4c3aceb3 |
112001141100211 has 24 divisors (see below), whose sum is σ = 124341389467344. Its totient is φ = 100799919000000.
The previous prime is 112001141100161. The next prime is 112001141100217.
It is a happy number.
112001141100211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 112001141100211 - 231 = 111998993616563 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112001141100217) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 110597061 + ... + 111605161.
It is an arithmetic number, because the mean of its divisors is an integer number (5180891227806).
Almost surely, 2112001141100211 is an apocalyptic number.
112001141100211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112001141100211 is a deficient number, since it is larger than the sum of its proper divisors (12340248367133).
112001141100211 is a wasteful number, since it uses less digits than its factorization.
112001141100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1017315 (or 1017304 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
It can be divided in two parts, 11200 and 1141100211, that added together give a palindrome (1141111411).
The spelling of 112001141100211 in words is "one hundred twelve trillion, one billion, one hundred forty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •