Base | Representation |
---|---|
bin | 1001001001010011110111… |
… | …00100101101110001010101 |
3 | 2122012121021211201111211110 |
4 | 10210221323210231301111 |
5 | 10114000023141231401 |
6 | 110434525541125233 |
7 | 4143660025221414 |
oct | 444517344556125 |
9 | 78177254644743 |
10 | 20111110102101 |
11 | 645408a3a22a7 |
12 | 23098020b9819 |
13 | b2b61478a795 |
14 | 4d7550a4d47b |
15 | 24d20965c9d6 |
hex | 124a7b92dc55 |
20111110102101 has 32 divisors (see below), whose sum is σ = 27845849927808. Its totient is φ = 12900261830400.
The previous prime is 20111110102091. The next prime is 20111110102151. The reversal of 20111110102101 is 10120101111102.
It is not a de Polignac number, because 20111110102101 - 239 = 19561354288213 is a prime.
It is a super-2 number, since 2×201111101021012 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111110102151) 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 31 ways as a sum of consecutive naturals, for example, 8186931 + ... + 10356063.
It is an arithmetic number, because the mean of its divisors is an integer number (870182810244).
Almost surely, 220111110102101 is an apocalyptic number.
It is an amenable number.
20111110102101 is a deficient number, since it is larger than the sum of its proper divisors (7734739825707).
20111110102101 is a wasteful number, since it uses less digits than its factorization.
20111110102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2170101.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 20111110102101 its reverse (10120101111102), we get a palindrome (30231211213203).
The spelling of 20111110102101 in words is "twenty trillion, one hundred eleven billion, one hundred ten million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •