Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …001001100100000010110 |
3 | 10220021102222211002111020 |
4 | 100001211321030200112 |
5 | 121020300101320042 |
6 | 2201521034222010 |
7 | 142363200035142 |
oct | 20014571144026 |
9 | 3807388732436 |
10 | 1101221120022 |
11 | 3950306825a1 |
12 | 159510884906 |
13 | 7cac9a858ba |
14 | 3b429734222 |
15 | 1d9a2cae3ec |
hex | 10065e4c816 |
1101221120022 has 8 divisors (see below), whose sum is σ = 2202442240056. Its totient is φ = 367073706672.
The previous prime is 1101221120017. The next prime is 1101221120089. The reversal of 1101221120022 is 2200211221011.
It is a sphenic number, since it is the product of 3 distinct primes.
1101221120022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 1101221119983 and 1101221120010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91768426663 + ... + 91768426674.
It is an arithmetic number, because the mean of its divisors is an integer number (275305280007).
Almost surely, 21101221120022 is an apocalyptic number.
1101221120022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101221120022 is a wasteful number, since it uses less digits than its factorization.
1101221120022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183536853342.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1101221120022 its reverse (2200211221011), we get a palindrome (3301432341033).
The spelling of 1101221120022 in words is "one trillion, one hundred one billion, two hundred twenty-one million, one hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •