Base | Representation |
---|---|
bin | 110000000001011001011000… |
… | …000110111010100000100111 |
3 | 1000200210201210110022001212122 |
4 | 300001121120012322200213 |
5 | 210140314101201133111 |
6 | 2025104541245140155 |
7 | 62325566255362502 |
oct | 6001313006724047 |
9 | 1020721713261778 |
10 | 211202200021031 |
11 | 6132839397785a |
12 | 1b83049955a65b |
13 | 90b038874019b |
14 | 3a22353522139 |
15 | 1963cc1de0cdb |
hex | c016581ba827 |
211202200021031 has 2 divisors, whose sum is σ = 211202200021032. Its totient is φ = 211202200021030.
The previous prime is 211202200020989. The next prime is 211202200021081. The reversal of 211202200021031 is 130120002202112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211202200021031 - 26 = 211202200020967 is a prime.
It is a super-2 number, since 2×2112022000210312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211202200021081) 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 as a sum of consecutive naturals, namely, 105601100010515 + 105601100010516.
It is an arithmetic number, because the mean of its divisors is an integer number (105601100010516).
Almost surely, 2211202200021031 is an apocalyptic number.
211202200021031 is a deficient number, since it is larger than the sum of its proper divisors (1).
211202200021031 is an equidigital number, since it uses as much as digits as its factorization.
211202200021031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 211202200021031 its reverse (130120002202112), we get a palindrome (341322202223143).
The spelling of 211202200021031 in words is "two hundred eleven trillion, two hundred two billion, two hundred million, twenty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •