Base | Representation |
---|---|
bin | 11011010011101100110111… |
… | …011101111101111111011110 |
3 | 120202020112221020100002211111 |
4 | 123103230313131331333132 |
5 | 111220214023340213042 |
6 | 1103233403440212234 |
7 | 34204006150312546 |
oct | 3323546735757736 |
9 | 522215836302744 |
10 | 120101101101022 |
11 | 352a46555a6858 |
12 | 1157849390a07a |
13 | 52026400b4282 |
14 | 2192cd2438326 |
15 | dd418a392517 |
hex | 6d3b3777dfde |
120101101101022 has 16 divisors (see below), whose sum is σ = 181435648447872. Its totient is φ = 59623366080600.
The previous prime is 120101101101019. The next prime is 120101101101043. The reversal of 120101101101022 is 220101101101021.
It is a happy number.
120101101101022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 120101101100993 and 120101101101011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 203320104 + ... + 203909947.
It is an arithmetic number, because the mean of its divisors is an integer number (11339728027992).
Almost surely, 2120101101101022 is an apocalyptic number.
120101101101022 is a deficient number, since it is larger than the sum of its proper divisors (61334547346850).
120101101101022 is a wasteful number, since it uses less digits than its factorization.
120101101101022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 407231103.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 120101101101022 its reverse (220101101101021), we get a palindrome (340202202202043).
Subtracting 120101101101022 from its reverse (220101101101021), we obtain a palindrome (99999999999999).
The spelling of 120101101101022 in words is "one hundred twenty trillion, one hundred one billion, one hundred one million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •