Base | Representation |
---|---|
bin | 11110100100101101011… |
… | …111000000010001000101 |
3 | 21102212001110010122201202 |
4 | 132210231133000101011 |
5 | 233410323020010041 |
6 | 4245104222432245 |
7 | 304535535163103 |
oct | 36445537002105 |
9 | 7385043118652 |
10 | 2101002110021 |
11 | 740036a10a91 |
12 | 29b231432685 |
13 | 12317b86c509 |
14 | 73990a4ac73 |
15 | 399ba1b3a9b |
hex | 1e92d7c0445 |
2101002110021 has 16 divisors (see below), whose sum is σ = 2321375376384. Its totient is φ = 1891387432704.
The previous prime is 2101002109979. The next prime is 2101002110033. The reversal of 2101002110021 is 1200112001012.
It is a cyclic number.
It is not a de Polignac number, because 2101002110021 - 218 = 2101001847877 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2101002109984 and 2101002110011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101002112021) 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, 26197235 + ... + 26277311.
It is an arithmetic number, because the mean of its divisors is an integer number (145085961024).
Almost surely, 22101002110021 is an apocalyptic number.
It is an amenable number.
2101002110021 is a deficient number, since it is larger than the sum of its proper divisors (220373266363).
2101002110021 is a wasteful number, since it uses less digits than its factorization.
2101002110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147220.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2101002110021 its reverse (1200112001012), we get a palindrome (3301114111033).
The spelling of 2101002110021 in words is "two trillion, one hundred one billion, two million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •