Base | Representation |
---|---|
bin | 110000000001100010110010… |
… | …001011000110010111101111 |
3 | 1000200211200212102002002011011 |
4 | 300001202302023012113233 |
5 | 210141000243024032343 |
6 | 2025113331440210051 |
7 | 62326404500324323 |
oct | 6001426213062757 |
9 | 1020750772062134 |
10 | 211212301002223 |
11 | 613316a76934a4 |
12 | 1b832438309927 |
13 | 90b1308325931 |
14 | 3a22a30c4d983 |
15 | 19641b3a9929d |
hex | c018b22c65ef |
211212301002223 has 2 divisors, whose sum is σ = 211212301002224. Its totient is φ = 211212301002222.
The previous prime is 211212301002211. The next prime is 211212301002259. The reversal of 211212301002223 is 322200103212112.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211212301002223 - 237 = 211074862048751 is a prime.
It is a super-2 number, since 2×2112123010022232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211212301002194 and 211212301002203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211212301032223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105606150501111 + 105606150501112.
It is an arithmetic number, because the mean of its divisors is an integer number (105606150501112).
Almost surely, 2211212301002223 is an apocalyptic number.
211212301002223 is a deficient number, since it is larger than the sum of its proper divisors (1).
211212301002223 is an equidigital number, since it uses as much as digits as its factorization.
211212301002223 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 211212301002223 its reverse (322200103212112), we get a palindrome (533412404214335).
The spelling of 211212301002223 in words is "two hundred eleven trillion, two hundred twelve billion, three hundred one million, two thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •