Base | Representation |
---|---|
bin | 110100001101001000… |
… | …1101101111110111111 |
3 | 101201101010202012010102 |
4 | 1220122101231332333 |
5 | 3314100130031421 |
6 | 123300322231315 |
7 | 11046122203052 |
oct | 1503221557677 |
9 | 351333665112 |
10 | 112110002111 |
11 | 4360019aa08 |
12 | 198894b553b |
13 | a7586aa573 |
14 | 55d7514a99 |
15 | 2db248860b |
hex | 1a1a46dfbf |
112110002111 has 8 divisors (see below), whose sum is σ = 117120751104. Its totient is φ = 107186396760.
The previous prime is 112110002063. The next prime is 112110002131. The reversal of 112110002111 is 111200011211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112110002111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112110002092 and 112110002101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112110002131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21783281 + ... + 21788426.
It is an arithmetic number, because the mean of its divisors is an integer number (14640093888).
Almost surely, 2112110002111 is an apocalyptic number.
112110002111 is a deficient number, since it is larger than the sum of its proper divisors (5010748993).
112110002111 is an equidigital number, since it uses as much as digits as its factorization.
112110002111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43571821.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112110002111 its reverse (111200011211), we get a palindrome (223310013322).
The spelling of 112110002111 in words is "one hundred twelve billion, one hundred ten million, two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •