Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …110111101100100011011100 |
3 | 112102212121122001101110002020 |
4 | 121002111321313230203130 |
5 | 103413034111012223400 |
6 | 1030104450554300140 |
7 | 32123224004216121 |
oct | 3102257167544334 |
9 | 472777561343066 |
10 | 110112121211100 |
11 | 320a3319896628 |
12 | 10424572727650 |
13 | 49596b40a4958 |
14 | 1d29652b32748 |
15 | cae407b622a0 |
hex | 642579dec8dc |
110112121211100 has 72 divisors (see below), whose sum is σ = 318817183404720. Its totient is φ = 29342392442880.
The previous prime is 110112121211063. The next prime is 110112121211159. The reversal of 110112121211100 is 1112121211011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 110112121211100.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 129825847 + ... + 130671246.
Almost surely, 2110112121211100 is an apocalyptic number.
110112121211100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110112121211100 is an abundant number, since it is smaller than the sum of its proper divisors (208705062193620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112121211100 is a wasteful number, since it uses less digits than its factorization.
110112121211100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 260498519 (or 260498512 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 110112121211100 its reverse (1112121211011), we get a palindrome (111224242422111).
The spelling of 110112121211100 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty-one million, two hundred eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •