Base | Representation |
---|---|
bin | 1001001001010010000001… |
… | …01011110101010011001001 |
3 | 2122012111201222122102110221 |
4 | 10210221000223311103021 |
5 | 10113441012230042301 |
6 | 110434243525110041 |
7 | 4143623400361402 |
oct | 444510053652311 |
9 | 78174658572427 |
10 | 20110122112201 |
11 | 6453722731920 |
12 | 2309587258321 |
13 | b2b4b7b97084 |
14 | 4d749974a9a9 |
15 | 24d19ca4eda1 |
hex | 124a40af54c9 |
20110122112201 has 16 divisors (see below), whose sum is σ = 22057583948928. Its totient is φ = 18182604988800.
The previous prime is 20110122112127. The next prime is 20110122112237. The reversal of 20110122112201 is 10221122101102.
It is a cyclic number.
It is not a de Polignac number, because 20110122112201 - 227 = 20109987894473 is a prime.
It is a super-2 number, since 2×201101221122012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20110122110201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4385581 + ... + 7710613.
It is an arithmetic number, because the mean of its divisors is an integer number (1378598996808).
Almost surely, 220110122112201 is an apocalyptic number.
It is an amenable number.
20110122112201 is a deficient number, since it is larger than the sum of its proper divisors (1947461836727).
20110122112201 is a wasteful number, since it uses less digits than its factorization.
20110122112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3328032.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20110122112201 its reverse (10221122101102), we get a palindrome (30331244213303).
The spelling of 20110122112201 in words is "twenty trillion, one hundred ten billion, one hundred twenty-two million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •