Base | Representation |
---|---|
bin | 11001011101111110011000… |
… | …100101111101111010001000 |
3 | 112200121011000000210110110221 |
4 | 121131332120211331322020 |
5 | 104140142023110431440 |
6 | 1034121052034315424 |
7 | 32410346205301303 |
oct | 3135763045757210 |
9 | 480534000713427 |
10 | 112011012202120 |
11 | 327656702a3469 |
12 | 10690599428b74 |
13 | 4a66793143155 |
14 | 1d9350d159b3a |
15 | ce39e438ed4a |
hex | 65df9897de88 |
112011012202120 has 64 divisors (see below), whose sum is σ = 252334091214000. Its totient is φ = 44749443760128.
The previous prime is 112011012202109. The next prime is 112011012202153. The reversal of 112011012202120 is 21202210110211.
It can be written as a sum of positive squares in 8 ways, for example, as 57266965440036 + 54744046762084 = 7567494^2 + 7398922^2 .
It is a junction number, because it is equal to n+sod(n) for n = 112011012202094 and 112011012202103.
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, 128193276 + ... + 129064084.
Almost surely, 2112011012202120 is an apocalyptic number.
112011012202120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112011012202120 is an abundant number, since it is smaller than the sum of its proper divisors (140323079011880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011012202120 is a wasteful number, since it uses less digits than its factorization.
112011012202120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 874762 (or 874758 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112011012202120 its reverse (21202210110211), we get a palindrome (133213222312331).
The spelling of 112011012202120 in words is "one hundred twelve trillion, eleven billion, twelve million, two hundred two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •