Base | Representation |
---|---|
bin | 110000000000000110100000… |
… | …011111011111111010010101 |
3 | 1000200111020010021220100112002 |
4 | 300000012200133133322111 |
5 | 210132334333322041041 |
6 | 2025000024025005045 |
7 | 62316266253545243 |
oct | 6000064037377225 |
9 | 1020436107810462 |
10 | 211113220112021 |
11 | 612a3683052177 |
12 | 1b8171a6323785 |
13 | 90a4b78070a56 |
14 | 3a1bd11cc1793 |
15 | 19618153b359b |
hex | c001a07dfe95 |
211113220112021 has 16 divisors (see below), whose sum is σ = 227396203415040. Its totient is φ = 195347566375920.
The previous prime is 211113220111967. The next prime is 211113220112063. The reversal of 211113220112021 is 120211022311112.
It is a cyclic number.
It is not a de Polignac number, because 211113220112021 - 246 = 140744475934357 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211113220111984 and 211113220112002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211113220112071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 48154046 + ... + 52354928.
It is an arithmetic number, because the mean of its divisors is an integer number (14212262713440).
Almost surely, 2211113220112021 is an apocalyptic number.
It is an amenable number.
211113220112021 is a deficient number, since it is larger than the sum of its proper divisors (16282983303019).
211113220112021 is a wasteful number, since it uses less digits than its factorization.
211113220112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4262456.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 211113220112021 its reverse (120211022311112), we get a palindrome (331324242423133).
The spelling of 211113220112021 in words is "two hundred eleven trillion, one hundred thirteen billion, two hundred twenty million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •