Base | Representation |
---|---|
bin | 1100010010110110110… |
… | …1101000001100001001 |
3 | 202012012022022200020012 |
4 | 3010231231220030021 |
5 | 11430034401131241 |
6 | 241011104441305 |
7 | 21155144132024 |
oct | 3045555501411 |
9 | 665168280205 |
10 | 211220333321 |
11 | 8163a40a748 |
12 | 34b29319235 |
13 | 16bc1a9cb6a |
14 | a31a3481bb |
15 | 57635376eb |
hex | 312db68309 |
211220333321 has 2 divisors, whose sum is σ = 211220333322. Its totient is φ = 211220333320.
The previous prime is 211220333299. The next prime is 211220333341. The reversal of 211220333321 is 123333022112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 141556537600 + 69663795721 = 376240^2 + 263939^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211220333321 is a prime.
It is a super-2 number, since 2×2112203333212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211220333341) 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 as a sum of consecutive naturals, namely, 105610166660 + 105610166661.
It is an arithmetic number, because the mean of its divisors is an integer number (105610166661).
Almost surely, 2211220333321 is an apocalyptic number.
It is an amenable number.
211220333321 is a deficient number, since it is larger than the sum of its proper divisors (1).
211220333321 is an equidigital number, since it uses as much as digits as its factorization.
211220333321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 211220333321 its reverse (123333022112), we get a palindrome (334553355433).
The spelling of 211220333321 in words is "two hundred eleven billion, two hundred twenty million, three hundred thirty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •