Base | Representation |
---|---|
bin | 11001011111100101110000… |
… | …101000110001110011010011 |
3 | 112200222202111201121121222210 |
4 | 121133211300220301303103 |
5 | 104144001334304000034 |
6 | 1034244050224003203 |
7 | 32421355645435056 |
oct | 3137456050616323 |
9 | 480882451547883 |
10 | 112122011000019 |
11 | 327a8750216189 |
12 | 106a9bb6760503 |
13 | 4a740a2549017 |
14 | 1d98a3cc56a9d |
15 | ce683decc8e9 |
hex | 65f970a31cd3 |
112122011000019 has 4 divisors (see below), whose sum is σ = 149496014666696. Its totient is φ = 74748007333344.
The previous prime is 112122010999993. The next prime is 112122011000047. The reversal of 112122011000019 is 910000110221211.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 112122011000019 - 28 = 112122010999763 is a prime.
It is a super-2 number, since 2×1121220110000192 (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 = 112122010999959 and 112122011000004.
It is not an unprimeable number, because it can be changed into a prime (112122011005019) 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, 18687001833334 + ... + 18687001833339.
It is an arithmetic number, because the mean of its divisors is an integer number (37374003666674).
Almost surely, 2112122011000019 is an apocalyptic number.
112122011000019 is a deficient number, since it is larger than the sum of its proper divisors (37374003666677).
112122011000019 is an equidigital number, since it uses as much as digits as its factorization.
112122011000019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37374003666676.
The product of its (nonzero) digits is 72, while the sum is 21.
The spelling of 112122011000019 in words is "one hundred twelve trillion, one hundred twenty-two billion, eleven million, nineteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •