Base | Representation |
---|---|
bin | 1100010010110010100… |
… | …0011101100111011001 |
3 | 202012011001012111211111 |
4 | 3010230220131213121 |
5 | 11430020230431243 |
6 | 241005220100321 |
7 | 21154534045162 |
oct | 3045450354731 |
9 | 665131174744 |
10 | 211202202073 |
11 | 81630156445 |
12 | 34b232346a1 |
13 | 16bbb0c2205 |
14 | a317b88769 |
15 | 5761b5539d |
hex | 312ca1d9d9 |
211202202073 has 2 divisors, whose sum is σ = 211202202074. Its totient is φ = 211202202072.
The previous prime is 211202202067. The next prime is 211202202103. The reversal of 211202202073 is 370202202112.
211202202073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 179121093529 + 32081108544 = 423227^2 + 179112^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211202202073 is a prime.
It is not a weakly prime, because it can be changed into another prime (211202202173) 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, 105601101036 + 105601101037.
It is an arithmetic number, because the mean of its divisors is an integer number (105601101037).
Almost surely, 2211202202073 is an apocalyptic number.
It is an amenable number.
211202202073 is a deficient number, since it is larger than the sum of its proper divisors (1).
211202202073 is an equidigital number, since it uses as much as digits as its factorization.
211202202073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 22.
Adding to 211202202073 its reverse (370202202112), we get a palindrome (581404404185).
The spelling of 211202202073 in words is "two hundred eleven billion, two hundred two million, two hundred two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •