Base | Representation |
---|---|
bin | 11001011111100011111111… |
… | …010101011101100100100011 |
3 | 112200222120121020202110111012 |
4 | 121133203333111131210203 |
5 | 104143433441142023021 |
6 | 1034243133441211135 |
7 | 32421260564233442 |
oct | 3137437725354443 |
9 | 480876536673435 |
10 | 112120110111011 |
11 | 327a7965213132 |
12 | 106a9766030aab |
13 | 4a73b5b793922 |
14 | 1d988dc5dad59 |
15 | ce677c19635b |
hex | 65f8ff55d923 |
112120110111011 has 4 divisors (see below), whose sum is σ = 112130502198000. Its totient is φ = 112109718024024.
The previous prime is 112120110110969. The next prime is 112120110111029. The reversal of 112120110111011 is 110111011021211.
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 112120110111011 - 226 = 112120043002147 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112120110111071) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 5196027311 + ... + 5196048888.
It is an arithmetic number, because the mean of its divisors is an integer number (28032625549500).
Almost surely, 2112120110111011 is an apocalyptic number.
112120110111011 is a deficient number, since it is larger than the sum of its proper divisors (10392086989).
112120110111011 is a wasteful number, since it uses less digits than its factorization.
112120110111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10392086988.
The product of its (nonzero) digits is 4, while the sum is 14.
Adding to 112120110111011 its reverse (110111011021211), we get a palindrome (222231121132222).
The spelling of 112120110111011 in words is "one hundred twelve trillion, one hundred twenty billion, one hundred ten million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •