Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …01010101101101000011110 |
3 | 2122012121000221021011112110 |
4 | 10210221311222231220132 |
5 | 10113444322304323402 |
6 | 110434512041214450 |
7 | 4143654413033364 |
oct | 444516552555036 |
9 | 78177027234473 |
10 | 20111011011102 |
11 | 6454039471810 |
12 | 2309794a91426 |
13 | b2b5ca0a495b |
14 | 4d7541817634 |
15 | 24d200ad756c |
hex | 124a75aada1e |
20111011011102 has 32 divisors (see below), whose sum is σ = 44313010775424. Its totient is φ = 6033906692000.
The previous prime is 20111011011101. The next prime is 20111011011109.
20111011011102 is nontrivially palindromic in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111011011101) 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, 1508470008 + ... + 1508483339.
It is an arithmetic number, because the mean of its divisors is an integer number (1384781586732).
Almost surely, 220111011011102 is an apocalyptic number.
20111011011102 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20111011011102 is an abundant number, since it is smaller than the sum of its proper divisors (24201999764322).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111011011102 is a wasteful number, since it uses less digits than its factorization.
20111011011102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3016953464.
The product of its (nonzero) digits is 4, while the sum is 12.
It can be divided in two parts, 2011101 and 1011102, that multiplied together give a palindrome (2033428243302).
The spelling of 20111011011102 in words is "twenty trillion, one hundred eleven billion, eleven million, eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •