Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …110111110110110000000 |
3 | 10220021010121210110200202 |
4 | 100001132232332312000 |
5 | 121020023324031422 |
6 | 2201501103504332 |
7 | 142360211043146 |
oct | 20013656766600 |
9 | 3807117713622 |
10 | 1101101002112 |
11 | 394a798a01a1 |
12 | 1594985b80a8 |
13 | 7caaac1a107 |
14 | 3b4177c7596 |
15 | 1d997483b92 |
hex | 1005ebbed80 |
1101101002112 has 32 divisors (see below), whose sum is σ = 2240271997920. Its totient is φ = 538836657664.
The previous prime is 1101101002093. The next prime is 1101101002153. The reversal of 1101101002112 is 2112001011011.
It is a tau number, because it is divible by the number of its divisors (32).
It is a junction number, because it is equal to n+sod(n) for n = 1101101002093 and 1101101002102.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 91508363 + ... + 91520394.
It is an arithmetic number, because the mean of its divisors is an integer number (70008499935).
Almost surely, 21101101002112 is an apocalyptic number.
It is an amenable number.
1101101002112 is an abundant number, since it is smaller than the sum of its proper divisors (1139170995808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101101002112 is an equidigital number, since it uses as much as digits as its factorization.
1101101002112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183028818 (or 183028806 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1101101002112 its reverse (2112001011011), we get a palindrome (3213102013123).
The spelling of 1101101002112 in words is "one trillion, one hundred one billion, one hundred one million, two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •