Base | Representation |
---|---|
bin | 110100001101001001… |
… | …0111100010110100111 |
3 | 101201101011100111110022 |
4 | 1220122102330112213 |
5 | 3314100220314421 |
6 | 123300333145355 |
7 | 11046125010653 |
oct | 1503222742647 |
9 | 351334314408 |
10 | 112110323111 |
11 | 4360039a0a6 |
12 | 1988962b25b |
13 | a7587906c7 |
14 | 55d7599a63 |
15 | 2db24ed7ab |
hex | 1a1a4bc5a7 |
112110323111 has 4 divisors (see below), whose sum is σ = 112152018000. Its totient is φ = 112068628224.
The previous prime is 112110323071. The next prime is 112110323153. The reversal of 112110323111 is 111323011211.
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 112110323111 - 214 = 112110306727 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 112110323111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112110323161) 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, 20843411 + ... + 20848788.
It is an arithmetic number, because the mean of its divisors is an integer number (28038004500).
Almost surely, 2112110323111 is an apocalyptic number.
112110323111 is a deficient number, since it is larger than the sum of its proper divisors (41694889).
112110323111 is an equidigital number, since it uses as much as digits as its factorization.
112110323111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41694888.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 112110323111 its reverse (111323011211), we get a palindrome (223433334322).
The spelling of 112110323111 in words is "one hundred twelve billion, one hundred ten million, three hundred twenty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •