Base | Representation |
---|---|
bin | 1001100110000110000000… |
… | …00010000000110100111110 |
3 | 2202201011001022210020202010 |
4 | 10303003000002000310332 |
5 | 10231201001341023402 |
6 | 112513130322512050 |
7 | 4305301114126656 |
oct | 463030002006476 |
9 | 82634038706663 |
10 | 21100101111102 |
11 | 67a5558aa9322 |
12 | 2449411205626 |
13 | ba0967001460 |
14 | 52d370d25366 |
15 | 268cde65aa6c |
hex | 1330c0080d3e |
21100101111102 has 64 divisors (see below), whose sum is σ = 46153152541440. Its totient is φ = 6391695308544.
The previous prime is 21100101111073. The next prime is 21100101111121. The reversal of 21100101111102 is 20111110100112.
It is a super-3 number, since 3×211001011111023 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 272652 + ... + 6501887.
It is an arithmetic number, because the mean of its divisors is an integer number (721143008460).
Almost surely, 221100101111102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 21100101111102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23076576270720).
21100101111102 is an abundant number, since it is smaller than the sum of its proper divisors (25053051430338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
21100101111102 is a wasteful number, since it uses less digits than its factorization.
21100101111102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6775177.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 21100101111102 its reverse (20111110100112), we get a palindrome (41211211211214).
The spelling of 21100101111102 in words is "twenty-one trillion, one hundred billion, one hundred one million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •