Base | Representation |
---|---|
bin | 10000000000100011101… |
… | …010001111000110001101 |
3 | 10220011120112212101020101 |
4 | 100000203222033012031 |
5 | 121011011113332341 |
6 | 2201214501051101 |
7 | 142323514611121 |
oct | 20004352170615 |
9 | 3804515771211 |
10 | 1100109902221 |
11 | 3946103a6180 |
12 | 1592606b6a91 |
13 | 7c9807a7c85 |
14 | 3b361d15581 |
15 | 1d93a45e831 |
hex | 10023a8f18d |
1100109902221 has 8 divisors (see below), whose sum is σ = 1219793990688. Its totient is φ = 983704830000.
The previous prime is 1100109902219. The next prime is 1100109902233. The reversal of 1100109902221 is 1222099010011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1100109902221 - 21 = 1100109902219 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1100109902221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100109902321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 819753355 + ... + 819754696.
It is an arithmetic number, because the mean of its divisors is an integer number (152474248836).
Almost surely, 21100109902221 is an apocalyptic number.
1100109902221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1100109902221 is a deficient number, since it is larger than the sum of its proper divisors (119684088467).
1100109902221 is a wasteful number, since it uses less digits than its factorization.
1100109902221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1639508123.
The product of its (nonzero) digits is 648, while the sum is 28.
The spelling of 1100109902221 in words is "one trillion, one hundred billion, one hundred nine million, nine hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •