Base | Representation |
---|---|
bin | 110000001111111100110010… |
… | …101110011100111001111101 |
3 | 1000211100100020011021200222212 |
4 | 300033330302232130321331 |
5 | 210303210302324400133 |
6 | 2031152220235350205 |
7 | 62461052551040651 |
oct | 6017746256347175 |
9 | 1024310204250885 |
10 | 212202300231293 |
11 | 61683543418149 |
12 | 1b972288bb2365 |
13 | 915378b6c4128 |
14 | 3a58908db2a61 |
15 | 197ed0734e148 |
hex | c0ff32b9ce7d |
212202300231293 has 2 divisors, whose sum is σ = 212202300231294. Its totient is φ = 212202300231292.
The previous prime is 212202300231269. The next prime is 212202300231319. The reversal of 212202300231293 is 392132003202212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 203420104301764 + 8782195929529 = 14262542^2 + 2963477^2 .
It is a cyclic number.
It is not a de Polignac number, because 212202300231293 - 232 = 212198005263997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212202300231223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106101150115646 + 106101150115647.
It is an arithmetic number, because the mean of its divisors is an integer number (106101150115647).
Almost surely, 2212202300231293 is an apocalyptic number.
It is an amenable number.
212202300231293 is a deficient number, since it is larger than the sum of its proper divisors (1).
212202300231293 is an equidigital number, since it uses as much as digits as its factorization.
212202300231293 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 212202300231293 in words is "two hundred twelve trillion, two hundred two billion, three hundred million, two hundred thirty-one thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •