Base | Representation |
---|---|
bin | 110000010000010000000110… |
… | …010101011011010011000111 |
3 | 1000211102022201212120211001221 |
4 | 300100100012111123103013 |
5 | 210304030231224410322 |
6 | 2031205525245101211 |
7 | 62462415346563316 |
oct | 6020200625332307 |
9 | 1024368655524057 |
10 | 212223030310087 |
11 | 61691310a70175 |
12 | 1b9762b3557807 |
13 | 915571340cc44 |
14 | 3a5991422227d |
15 | 198061c22e9c7 |
hex | c1040655b4c7 |
212223030310087 has 2 divisors, whose sum is σ = 212223030310088. Its totient is φ = 212223030310086.
The previous prime is 212223030309949. The next prime is 212223030310099. The reversal of 212223030310087 is 780013030322212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212223030310087 - 243 = 203426937287879 is a prime.
It is a super-2 number, since 2×2122230303100872 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212223030311087) 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, 106111515155043 + 106111515155044.
It is an arithmetic number, because the mean of its divisors is an integer number (106111515155044).
Almost surely, 2212223030310087 is an apocalyptic number.
212223030310087 is a deficient number, since it is larger than the sum of its proper divisors (1).
212223030310087 is an equidigital number, since it uses as much as digits as its factorization.
212223030310087 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24192, while the sum is 34.
Adding to 212223030310087 its reverse (780013030322212), we get a palindrome (992236060632299).
The spelling of 212223030310087 in words is "two hundred twelve trillion, two hundred twenty-three billion, thirty million, three hundred ten thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •