Base | Representation |
---|---|
bin | 110000000001101011000101… |
… | …010000011011100000011011 |
3 | 1000200212112212101000000011101 |
4 | 300001223011100123200123 |
5 | 210141122020020214321 |
6 | 2025121403530412231 |
7 | 62330141342034313 |
oct | 6001530520334033 |
9 | 1020775771000141 |
10 | 211221211101211 |
11 | 6133545a160773 |
12 | 1b834104291077 |
13 | 90b20c828a05c |
14 | 3a23238342443 |
15 | 1964535e18791 |
hex | c01ac541b81b |
211221211101211 has 2 divisors, whose sum is σ = 211221211101212. Its totient is φ = 211221211101210.
The previous prime is 211221211101169. The next prime is 211221211101221. The reversal of 211221211101211 is 112101112122112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211221211101211 - 211 = 211221211099163 is a prime.
It is a super-2 number, since 2×2112212111012112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211221211101221) 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, 105610605550605 + 105610605550606.
It is an arithmetic number, because the mean of its divisors is an integer number (105610605550606).
Almost surely, 2211221211101211 is an apocalyptic number.
211221211101211 is a deficient number, since it is larger than the sum of its proper divisors (1).
211221211101211 is an equidigital number, since it uses as much as digits as its factorization.
211221211101211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 211221211101211 its reverse (112101112122112), we get a palindrome (323322323223323).
The spelling of 211221211101211 in words is "two hundred eleven trillion, two hundred twenty-one billion, two hundred eleven million, one hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •