Base | Representation |
---|---|
bin | 10000000000100011001… |
… | …000101111001111111110 |
3 | 10220011112221100020200210 |
4 | 100000203020233033332 |
5 | 121011001341333042 |
6 | 2201213544533250 |
7 | 142323350146011 |
oct | 20004310571776 |
9 | 3804487306623 |
10 | 1100101121022 |
11 | 394606448792 |
12 | 159259781226 |
13 | 7c97ba220b7 |
14 | 3b360aab378 |
15 | 1d9397c7a9c |
hex | 1002322f3fe |
1100101121022 has 16 divisors (see below), whose sum is σ = 2209331714832. Its totient is φ = 365178794880.
The previous prime is 1100101120997. The next prime is 1100101121023. The reversal of 1100101121022 is 2201211010011.
It is a super-2 number, since 2×11001011210222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100101120989 and 1100101121007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100101121023) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 380393133 + ... + 380396024.
It is an arithmetic number, because the mean of its divisors is an integer number (138083232177).
Almost surely, 21100101121022 is an apocalyptic number.
1100101121022 is an abundant number, since it is smaller than the sum of its proper divisors (1109230593810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100101121022 is a wasteful number, since it uses less digits than its factorization.
1100101121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760789403.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1100101121022 its reverse (2201211010011), we get a palindrome (3301312131033).
The spelling of 1100101121022 in words is "one trillion, one hundred billion, one hundred one million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •