Base | Representation |
---|---|
bin | 11001011111011100011101… |
… | …001100000001111000111100 |
3 | 112200221210201111201001222222 |
4 | 121133130131030001320330 |
5 | 104143320404340121340 |
6 | 1034235315040024512 |
7 | 32420553252135404 |
oct | 3137343514017074 |
9 | 480853644631888 |
10 | 112112021020220 |
11 | 327a4494125531 |
12 | 106a8089002138 |
13 | 4a7316c959680 |
14 | 1d98372181804 |
15 | ce6456e4d8b5 |
hex | 65f71d301e3c |
112112021020220 has 96 divisors (see below), whose sum is σ = 257358685534272. Its totient is φ = 40777165836288.
The previous prime is 112112021020189. The next prime is 112112021020247. The reversal of 112112021020220 is 22020120211211.
It is a super-2 number, since 2×1121120210202202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6916367 + ... + 16494246.
It is an arithmetic number, because the mean of its divisors is an integer number (2680819640982).
Almost surely, 2112112021020220 is an apocalyptic number.
112112021020220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112112021020220 is an abundant number, since it is smaller than the sum of its proper divisors (145246664514052).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112112021020220 is a wasteful number, since it uses less digits than its factorization.
112112021020220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23410911 (or 23410909 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 112112021020220 its reverse (22020120211211), we get a palindrome (134132141231431).
The spelling of 112112021020220 in words is "one hundred twelve trillion, one hundred twelve billion, twenty-one million, twenty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •