Base | Representation |
---|---|
bin | 11001011111011010110111… |
… | …010001001111110110110010 |
3 | 112200221122022100012202001010 |
4 | 121133122313101033312302 |
5 | 104143303404121041424 |
6 | 1034234433234451350 |
7 | 32420463010145520 |
oct | 3137326721176662 |
9 | 480848270182033 |
10 | 112110311112114 |
11 | 327a3796a05237 |
12 | 106a7890433b56 |
13 | 4a72c59621323 |
14 | 1d9824d03b310 |
15 | ce63a6c8e229 |
hex | 65f6b744fdb2 |
112110311112114 has 16 divisors (see below), whose sum is σ = 256252139684928. Its totient is φ = 32031517460592.
The previous prime is 112110311112029. The next prime is 112110311112131. The reversal of 112110311112114 is 411211113011211.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1334646560817 + ... + 1334646560900.
It is an arithmetic number, because the mean of its divisors is an integer number (16015758730308).
Almost surely, 2112110311112114 is an apocalyptic number.
112110311112114 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
112110311112114 is an abundant number, since it is smaller than the sum of its proper divisors (144141828572814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112110311112114 is a wasteful number, since it uses less digits than its factorization.
112110311112114 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2669293121729.
The product of its (nonzero) digits is 48, while the sum is 21.
Adding to 112110311112114 its reverse (411211113011211), we get a palindrome (523321424123325).
The spelling of 112110311112114 in words is "one hundred twelve trillion, one hundred ten billion, three hundred eleven million, one hundred twelve thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •