Base | Representation |
---|---|
bin | 11001011111010010011001… |
… | …011001110010011110110011 |
3 | 112200220202211202212110220110 |
4 | 121133102121121302132303 |
5 | 104143131244321200034 |
6 | 1034230331202512403 |
7 | 32420021510625213 |
oct | 3137223131623663 |
9 | 480822752773813 |
10 | 112101220100019 |
11 | 3279a9513012a7 |
12 | 106a5b73965703 |
13 | 4a7213b056527 |
14 | 1d97a298d4243 |
15 | ce6023ad5de9 |
hex | 65f4996727b3 |
112101220100019 has 4 divisors (see below), whose sum is σ = 149468293466696. Its totient is φ = 74734146733344.
The previous prime is 112101220099949. The next prime is 112101220100141. The reversal of 112101220100019 is 910001022101211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 112101220100019 - 212 = 112101220095923 is a prime.
It is a super-2 number, since 2×1121012201000192 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112101220099968 and 112101220100004.
It is not an unprimeable number, because it can be changed into a prime (112101220000019) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18683536683334 + ... + 18683536683339.
It is an arithmetic number, because the mean of its divisors is an integer number (37367073366674).
Almost surely, 2112101220100019 is an apocalyptic number.
112101220100019 is a deficient number, since it is larger than the sum of its proper divisors (37367073366677).
112101220100019 is an equidigital number, since it uses as much as digits as its factorization.
112101220100019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37367073366676.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 112101220100019 in words is "one hundred twelve trillion, one hundred one billion, two hundred twenty million, one hundred thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •