Base | Representation |
---|---|
bin | 110000000001101100110000… |
… | …000001000010110111000011 |
3 | 1000200212201111012022210020111 |
4 | 300001230300001002313003 |
5 | 210141134202032331321 |
6 | 2025122301352452151 |
7 | 62330233621263616 |
oct | 6001546001026703 |
9 | 1020781435283214 |
10 | 211223002230211 |
11 | 61336199206474 |
12 | 1b8345240aa057 |
13 | 90b23223923ba |
14 | 3a2336818a17d |
15 | 19645dd2bd5e1 |
hex | c01b30042dc3 |
211223002230211 has 2 divisors, whose sum is σ = 211223002230212. Its totient is φ = 211223002230210.
The previous prime is 211223002230157. The next prime is 211223002230269. The reversal of 211223002230211 is 112032200322112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211223002230211 - 29 = 211223002229699 is a prime.
It is a super-2 number, since 2×2112230022302112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211223002233211) 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, 105611501115105 + 105611501115106.
It is an arithmetic number, because the mean of its divisors is an integer number (105611501115106).
Almost surely, 2211223002230211 is an apocalyptic number.
211223002230211 is a deficient number, since it is larger than the sum of its proper divisors (1).
211223002230211 is an equidigital number, since it uses as much as digits as its factorization.
211223002230211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 211223002230211 its reverse (112032200322112), we get a palindrome (323255202552323).
The spelling of 211223002230211 in words is "two hundred eleven trillion, two hundred twenty-three billion, two million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •