Base | Representation |
---|---|
bin | 1001001001010101100100… |
… | …11010010001011001010111 |
3 | 2122012200122221212211012221 |
4 | 10210222302122101121113 |
5 | 10114003414202030234 |
6 | 110435201124123211 |
7 | 4144021566165136 |
oct | 444526232213127 |
9 | 78180587784187 |
10 | 20112030111319 |
11 | 64545117508a3 |
12 | 2309a1a236507 |
13 | b2b73026b833 |
14 | 4d75dacd791d |
15 | 24d2602dceb4 |
hex | 124ab2691657 |
20112030111319 has 4 divisors (see below), whose sum is σ = 20655598492744. Its totient is φ = 19568461729896.
The previous prime is 20112030111293. The next prime is 20112030111389. The reversal of 20112030111319 is 91311103021102.
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 20112030111319 - 215 = 20112030078551 is a prime.
It is a super-2 number, since 2×201120301113192 (a number of 27 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 = 20112030111293 and 20112030111302.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112030111389) 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, 271784190657 + ... + 271784190730.
It is an arithmetic number, because the mean of its divisors is an integer number (5163899623186).
Almost surely, 220112030111319 is an apocalyptic number.
20112030111319 is a deficient number, since it is larger than the sum of its proper divisors (543568381425).
20112030111319 is an equidigital number, since it uses as much as digits as its factorization.
20112030111319 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 543568381424.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 20112030111319 in words is "twenty trillion, one hundred twelve billion, thirty million, one hundred eleven thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •