Base | Representation |
---|---|
bin | 11001010001000010100010… |
… | …100011001101101001000110 |
3 | 112120110011121200012220022202 |
4 | 121101002202203031221012 |
5 | 104031111100440201042 |
6 | 1032200444143354502 |
7 | 32256210515031635 |
oct | 3121024243155106 |
9 | 476404550186282 |
10 | 111122121022022 |
11 | 32452699407470 |
12 | 105682655b2a32 |
13 | 4a00a03cc2876 |
14 | 1d624a728d51c |
15 | cca81c24a632 |
hex | 6510a28cda46 |
111122121022022 has 8 divisors (see below), whose sum is σ = 181836198036072. Its totient is φ = 50510055010000.
The previous prime is 111122121022021. The next prime is 111122121022051. The reversal of 111122121022022 is 220220121221111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 111122121021985 and 111122121022003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111122121022021) 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 3 ways as a sum of consecutive naturals, for example, 2525502750479 + ... + 2525502750522.
It is an arithmetic number, because the mean of its divisors is an integer number (22729524754509).
Almost surely, 2111122121022022 is an apocalyptic number.
111122121022022 is a deficient number, since it is larger than the sum of its proper divisors (70714077014050).
111122121022022 is a wasteful number, since it uses less digits than its factorization.
111122121022022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5051005501014.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 111122121022022 its reverse (220220121221111), we get a palindrome (331342242243133).
The spelling of 111122121022022 in words is "one hundred eleven trillion, one hundred twenty-two billion, one hundred twenty-one million, twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •