Base | Representation |
---|---|
bin | 10000000000100100010… |
… | …101000010010011100110 |
3 | 10220011121022222101220120 |
4 | 100000210111002103212 |
5 | 121011022001401042 |
6 | 2201215541342410 |
7 | 142324012150656 |
oct | 20004425022346 |
9 | 3804538871816 |
10 | 1100121122022 |
11 | 39461676983a |
12 | 159264407a06 |
13 | 7c982c05b00 |
14 | 3b3635d6366 |
15 | 1d93b428dec |
hex | 100245424e6 |
1100121122022 has 24 divisors (see below), whose sum is σ = 2382510834504. Its totient is φ = 338498806464.
The previous prime is 1100121122021. The next prime is 1100121122029. The reversal of 1100121122022 is 2202211210011.
It is a junction number, because it is equal to n+sod(n) for n = 1100121121992 and 1100121122010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100121122021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 542465023 + ... + 542467050.
It is an arithmetic number, because the mean of its divisors is an integer number (99271284771).
Almost surely, 21100121122022 is an apocalyptic number.
1100121122022 is an abundant number, since it is smaller than the sum of its proper divisors (1282389712482).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100121122022 is a wasteful number, since it uses less digits than its factorization.
1100121122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1084932104 (or 1084932091 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1100121122022 its reverse (2202211210011), we get a palindrome (3302332332033).
The spelling of 1100121122022 in words is "one trillion, one hundred billion, one hundred twenty-one million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •