Base | Representation |
---|---|
bin | 11001011111011011001100… |
… | …011100111000010010011100 |
3 | 112200221200020002220110001000 |
4 | 121133123030130320102130 |
5 | 104143310121104422334 |
6 | 1034234532411350300 |
7 | 32420504553562011 |
oct | 3137331434702234 |
9 | 480850202813030 |
10 | 112110666482844 |
11 | 327a3959568557 |
12 | 106a796b452390 |
13 | 4a72cb5137c73 |
14 | 1d98284305708 |
15 | ce63c8089299 |
hex | 65f6cc73849c |
112110666482844 has 48 divisors (see below), whose sum is σ = 290657938586400. Its totient is φ = 37370137932288.
The previous prime is 112110666482767. The next prime is 112110666482849. The reversal of 112110666482844 is 448284666011211.
It is a super-2 number, since 2×1121106664828442 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112110666482849) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 63385162 + ... + 65129870.
It is an arithmetic number, because the mean of its divisors is an integer number (6055373720550).
Almost surely, 2112110666482844 is an apocalyptic number.
It is an amenable number.
112110666482844 is an abundant number, since it is smaller than the sum of its proper divisors (178547272103556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110666482844 is a wasteful number, since it uses less digits than its factorization.
112110666482844 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2339699 (or 2339691 counting only the distinct ones).
The product of its (nonzero) digits is 3538944, while the sum is 54.
The spelling of 112110666482844 in words is "one hundred twelve trillion, one hundred ten billion, six hundred sixty-six million, four hundred eighty-two thousand, eight hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •