Base | Representation |
---|---|
bin | 110010000011001100110111… |
… | …101100001100110100011110 |
3 | 1001212101111010210011220222220 |
4 | 302003030313230030310132 |
5 | 212322440434111033042 |
6 | 2100054442354050210 |
7 | 64236211606510056 |
oct | 6203146754146436 |
9 | 1055344123156886 |
10 | 220122303221022 |
11 | 64157387656554 |
12 | 20831215b79966 |
13 | 95a95a098c247 |
14 | 3c4dd95054566 |
15 | 1a6ad461d68ec |
hex | c83337b0cd1e |
220122303221022 has 32 divisors (see below), whose sum is σ = 452165728984992. Its totient is φ = 71387445734784.
The previous prime is 220122303221017. The next prime is 220122303221039.
220122303221022 is nontrivially palindromic in base 10.
220122303221022 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 = 220122303220983 and 220122303221001.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 20352933 + ... + 29231600.
It is an arithmetic number, because the mean of its divisors is an integer number (14130179030781).
Almost surely, 2220122303221022 is an apocalyptic number.
220122303221022 is an abundant number, since it is smaller than the sum of its proper divisors (232043425763970).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220122303221022 is a wasteful number, since it uses less digits than its factorization.
220122303221022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49604572.
The product of its (nonzero) digits is 2304, while the sum is 24.
It can be divided in two parts, 22012230 and 3221022, that added together give a palindrome (25233252).
The spelling of 220122303221022 in words is "two hundred twenty trillion, one hundred twenty-two billion, three hundred three million, two hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •