Base | Representation |
---|---|
bin | 1001001001100110011110… |
… | …01101000001101100111011 |
3 | 2122020120002021100001201221 |
4 | 10210303033031001230323 |
5 | 10114131004344104034 |
6 | 110443301314052511 |
7 | 4144462456344136 |
oct | 444631715015473 |
9 | 78216067301657 |
10 | 20121103113019 |
11 | 6458348173307 |
12 | 230b73087a137 |
13 | b2c547b9b9ac |
14 | 4d7c1bcb321d |
15 | 24d5e1ad9bb4 |
hex | 124ccf341b3b |
20121103113019 has 16 divisors (see below), whose sum is σ = 21201286758400. Its totient is φ = 19043040129984.
The previous prime is 20121103112947. The next prime is 20121103113037. The reversal of 20121103113019 is 91031130112102.
It is a cyclic number.
It is not a de Polignac number, because 20121103113019 - 213 = 20121103104827 is a prime.
It is a super-2 number, since 2×201211031130192 (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 = 20121103112984 and 20121103113002.
It is not an unprimeable number, because it can be changed into a prime (20121103113919) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 323787319 + ... + 323849455.
It is an arithmetic number, because the mean of its divisors is an integer number (1325080422400).
Almost surely, 220121103113019 is an apocalyptic number.
20121103113019 is a deficient number, since it is larger than the sum of its proper divisors (1080183645381).
20121103113019 is a wasteful number, since it uses less digits than its factorization.
20121103113019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78922.
The product of its (nonzero) digits is 324, while the sum is 25.
The spelling of 20121103113019 in words is "twenty trillion, one hundred twenty-one billion, one hundred three million, one hundred thirteen thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •