Base | Representation |
---|---|
bin | 110100001101001110… |
… | …1100010010101001111 |
3 | 101201101100120120210011 |
4 | 1220122131202111033 |
5 | 3314101423200421 |
6 | 123300512454051 |
7 | 11046160425115 |
oct | 1503235422517 |
9 | 351340516704 |
10 | 112113100111 |
11 | 43601a16541 |
12 | 1988a54a327 |
13 | a7592236bc |
14 | 55d7abdab5 |
15 | 2db289b4e1 |
hex | 1a1a76254f |
112113100111 has 4 divisors (see below), whose sum is σ = 112116162592. Its totient is φ = 112110037632.
The previous prime is 112113100109. The next prime is 112113100207. The reversal of 112113100111 is 111001311211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 112113100111 - 21 = 112113100109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112113100091 and 112113100100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112113130111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1475655 + ... + 1549768.
It is an arithmetic number, because the mean of its divisors is an integer number (28029040648).
Almost surely, 2112113100111 is an apocalyptic number.
112113100111 is a deficient number, since it is larger than the sum of its proper divisors (3062481).
112113100111 is an equidigital number, since it uses as much as digits as its factorization.
112113100111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3062480.
The product of its (nonzero) digits is 6, while the sum is 13.
Adding to 112113100111 its reverse (111001311211), we get a palindrome (223114411322).
The spelling of 112113100111 in words is "one hundred twelve billion, one hundred thirteen million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •