Base | Representation |
---|---|
bin | 11001010000101110111110… |
… | …001100111010000000110110 |
3 | 112120101011101101110110210110 |
4 | 121100232332030322000312 |
5 | 104030240033141200042 |
6 | 1032143051222403450 |
7 | 32254535036114400 |
oct | 3120567614720066 |
9 | 476334341413713 |
10 | 111101110100022 |
11 | 32444797284819 |
12 | 10564180b90586 |
13 | 49cba36055643 |
14 | 1d61472a15b70 |
15 | cc9edc89209c |
hex | 650bbe33a036 |
111101110100022 has 48 divisors (see below), whose sum is σ = 265466083287600. Its totient is φ = 30885250681152.
The previous prime is 111101110100009. The next prime is 111101110100119. The reversal of 111101110100022 is 220001011101111.
It is a junction number, because it is equal to n+sod(n) for n = 111101110099980 and 111101110100007.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5106677397 + ... + 5106699152.
It is an arithmetic number, because the mean of its divisors is an integer number (5530543401825).
Almost surely, 2111101110100022 is an apocalyptic number.
111101110100022 is an abundant number, since it is smaller than the sum of its proper divisors (154364973187578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111101110100022 is a wasteful number, since it uses less digits than its factorization.
111101110100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10213376605 (or 10213376598 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 111101110100022 its reverse (220001011101111), we get a palindrome (331102121201133).
The spelling of 111101110100022 in words is "one hundred eleven trillion, one hundred one billion, one hundred ten million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •