Base | Representation |
---|---|
bin | 1001100110011010011111… |
… | …00111100001100100010011 |
3 | 2202202012102212011202122210 |
4 | 10303031033213201210103 |
5 | 10231341013101133021 |
6 | 112522145551403203 |
7 | 4306140511252500 |
oct | 463151747414423 |
9 | 82665385152583 |
10 | 21111100021011 |
11 | 67aa192662110 |
12 | 244b580823503 |
13 | ba19ca936880 |
14 | 52dad59d04a7 |
15 | 269235081e76 |
hex | 13334f9e1913 |
21111100021011 has 96 divisors (see below), whose sum is σ = 40140708668928. Its totient is φ = 9683065244160.
The previous prime is 21111100021003. The next prime is 21111100021073. The reversal of 21111100021011 is 11012000111112.
It is not a de Polignac number, because 21111100021011 - 23 = 21111100021003 is a prime.
It is not an unprimeable number, because it can be changed into a prime (21111100021111) 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 95 ways as a sum of consecutive naturals, for example, 21348826 + ... + 22315791.
It is an arithmetic number, because the mean of its divisors is an integer number (418132381968).
Almost surely, 221111100021011 is an apocalyptic number.
21111100021011 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
21111100021011 is a deficient number, since it is larger than the sum of its proper divisors (19029608647917).
21111100021011 is a wasteful number, since it uses less digits than its factorization.
21111100021011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43664681 (or 43664674 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 21111100021011 its reverse (11012000111112), we get a palindrome (32123100132123).
The spelling of 21111100021011 in words is "twenty-one trillion, one hundred eleven billion, one hundred million, twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •