Base | Representation |
---|---|
bin | 1011110000111011110… |
… | …0111100111001100101 |
3 | 201022200200202101001102 |
4 | 2330032330330321211 |
5 | 11302412231301041 |
6 | 232503335205445 |
7 | 20413403251103 |
oct | 2741674747145 |
9 | 638620671042 |
10 | 202114322021 |
11 | 787972a1677 |
12 | 33207816885 |
13 | 160a0382bb1 |
14 | 9ad4c18c73 |
15 | 53cddba09b |
hex | 2f0ef3ce65 |
202114322021 has 2 divisors, whose sum is σ = 202114322022. Its totient is φ = 202114322020.
The previous prime is 202114321963. The next prime is 202114322077. The reversal of 202114322021 is 120223411202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 200358292996 + 1756029025 = 447614^2 + 41905^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202114322021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 202114321984 and 202114322002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202114322521) 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 as a sum of consecutive naturals, namely, 101057161010 + 101057161011.
It is an arithmetic number, because the mean of its divisors is an integer number (101057161011).
Almost surely, 2202114322021 is an apocalyptic number.
It is an amenable number.
202114322021 is a deficient number, since it is larger than the sum of its proper divisors (1).
202114322021 is an equidigital number, since it uses as much as digits as its factorization.
202114322021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 202114322021 its reverse (120223411202), we get a palindrome (322337733223).
The spelling of 202114322021 in words is "two hundred two billion, one hundred fourteen million, three hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •