Base | Representation |
---|---|
bin | 1100010010000111100… |
… | …1000101011010100101 |
3 | 202011200111010210210210 |
4 | 3010201321011122211 |
5 | 11424133113310041 |
6 | 240535302010033 |
7 | 21150215330004 |
oct | 3044171053245 |
9 | 664614123723 |
10 | 211022010021 |
11 | 81548472499 |
12 | 34a92a16919 |
13 | 16b8c981ab4 |
14 | a2dbc80c3b |
15 | 5750e10016 |
hex | 3121e456a5 |
211022010021 has 8 divisors (see below), whose sum is σ = 297913425984. Its totient is φ = 132405967040.
The previous prime is 211022010019. The next prime is 211022010029. The reversal of 211022010021 is 120010220112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211022010021 - 21 = 211022010019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 211022009979 and 211022010006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211022010029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2068843185 + ... + 2068843286.
It is an arithmetic number, because the mean of its divisors is an integer number (37239178248).
Almost surely, 2211022010021 is an apocalyptic number.
It is an amenable number.
211022010021 is a deficient number, since it is larger than the sum of its proper divisors (86891415963).
211022010021 is a wasteful number, since it uses less digits than its factorization.
211022010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4137686491.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 211022010021 its reverse (120010220112), we get a palindrome (331032230133).
The spelling of 211022010021 in words is "two hundred eleven billion, twenty-two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •