Base | Representation |
---|---|
bin | 1100110011101001010… |
… | …1010111100011010000 |
3 | 210000220201020021200120 |
4 | 3030322111113203100 |
5 | 12101101113341422 |
6 | 245024323150240 |
7 | 21616231150110 |
oct | 3147225274320 |
9 | 700821207616 |
10 | 220022012112 |
11 | 85346765251 |
12 | 36784b15380 |
13 | 17995433016 |
14 | a913297040 |
15 | 5acb0dc45c |
hex | 333a5578d0 |
220022012112 has 40 divisors (see below), whose sum is σ = 649588798656. Its totient is φ = 62863431936.
The previous prime is 220022012069. The next prime is 220022012113. The reversal of 220022012112 is 211210220022.
220022012112 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 = 220022012091 and 220022012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220022012113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 327413373 + ... + 327414044.
Almost surely, 2220022012112 is an apocalyptic number.
It is an amenable number.
220022012112 is an abundant number, since it is smaller than the sum of its proper divisors (429566786544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220022012112 is a wasteful number, since it uses less digits than its factorization.
220022012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654827435 (or 654827429 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220022012112 its reverse (211210220022), we get a palindrome (431232232134).
The spelling of 220022012112 in words is "two hundred twenty billion, twenty-two million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •