Base | Representation |
---|---|
bin | 1010000110011101100001… |
… | …0110100101101001111101 |
3 | 1110022201211121122110020121 |
4 | 2201213120112211221331 |
5 | 2423430313241311341 |
6 | 35342025313014541 |
7 | 2224251004414150 |
oct | 241473026455175 |
9 | 43281747573217 |
10 | 11106120260221 |
11 | 35a2096395108 |
12 | 12b4535254451 |
13 | 6273c1bb7a3c |
14 | 2a577938bc97 |
15 | 143d67d844d1 |
hex | a19d85a5a7d |
11106120260221 has 4 divisors (see below), whose sum is σ = 12692708868832. Its totient is φ = 9519531651612.
The previous prime is 11106120260171. The next prime is 11106120260267. The reversal of 11106120260221 is 12206202160111.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11106120260221 - 27 = 11106120260093 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 (11106120360221) 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 3 ways as a sum of consecutive naturals, for example, 793294304295 + ... + 793294304308.
It is an arithmetic number, because the mean of its divisors is an integer number (3173177217208).
Almost surely, 211106120260221 is an apocalyptic number.
It is an amenable number.
11106120260221 is a deficient number, since it is larger than the sum of its proper divisors (1586588608611).
11106120260221 is an equidigital number, since it uses as much as digits as its factorization.
11106120260221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586588608610.
The product of its (nonzero) digits is 576, while the sum is 25.
The spelling of 11106120260221 in words is "eleven trillion, one hundred six billion, one hundred twenty million, two hundred sixty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •