Base | Representation |
---|---|
bin | 110010000100011111100101… |
… | …000111010001001010111110 |
3 | 1001212200222101000210111002102 |
4 | 302010133211013101022332 |
5 | 212330414324200333042 |
6 | 2100203331025025102 |
7 | 64245504433633631 |
oct | 6204374507211276 |
9 | 1055628330714072 |
10 | 220211112121022 |
11 | 6419100a99a580 |
12 | 2084647ba85192 |
13 | 95b4a84ab5009 |
14 | 3c543bba9bc18 |
15 | 1a6d2e2bd4b32 |
hex | c847e51d12be |
220211112121022 has 16 divisors (see below), whose sum is σ = 360350911004400. Its totient is φ = 100094444831040.
The previous prime is 220211112121003. The next prime is 220211112121069. The reversal of 220211112121022 is 220121211112022.
220211112121022 is digitally balanced in base 2, 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 = 220211112120985 and 220211112121003.
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, 74274197 + ... + 77182112.
It is an arithmetic number, because the mean of its divisors is an integer number (22521931937775).
Almost surely, 2220211112121022 is an apocalyptic number.
220211112121022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
220211112121022 is a deficient number, since it is larger than the sum of its proper divisors (140139798883378).
220211112121022 is a wasteful number, since it uses less digits than its factorization.
220211112121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151522411.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 220211112121022 its reverse (220121211112022), we get a palindrome (440332323233044).
The spelling of 220211112121022 in words is "two hundred twenty trillion, two hundred eleven billion, one hundred twelve million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •