Base | Representation |
---|---|
bin | 110010000011000010010110… |
… | …000101100000010111101000 |
3 | 1001212100101222011221222102220 |
4 | 302003002112011200113220 |
5 | 212322244313003323422 |
6 | 2100045333125554040 |
7 | 64235331552015162 |
oct | 6203022605402750 |
9 | 1055311864858386 |
10 | 220111002011112 |
11 | 64152608398253 |
12 | 2082aba1275920 |
13 | 95a84bc5321a4 |
14 | 3c4d602177932 |
15 | 1a6a8d3e99e5c |
hex | c830961605e8 |
220111002011112 has 16 divisors (see below), whose sum is σ = 550277505027840. Its totient is φ = 73370334003696.
The previous prime is 220111002011111. The next prime is 220111002011239. The reversal of 220111002011112 is 211110200111022.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 220111002011091 and 220111002011100.
It is not an unprimeable number, because it can be changed into a prime (220111002011111) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4585645875208 + ... + 4585645875255.
It is an arithmetic number, because the mean of its divisors is an integer number (34392344064240).
Almost surely, 2220111002011112 is an apocalyptic number.
It is an amenable number.
220111002011112 is an abundant number, since it is smaller than the sum of its proper divisors (330166503016728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220111002011112 is a wasteful number, since it uses less digits than its factorization.
220111002011112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9171291750472 (or 9171291750468 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 220111002011112 its reverse (211110200111022), we get a palindrome (431221202122134).
The spelling of 220111002011112 in words is "two hundred twenty trillion, one hundred eleven billion, two million, eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •