Base | Representation |
---|---|
bin | 110000001110110000011100… |
… | …111111011010010111010101 |
3 | 1000211001111122121002110210101 |
4 | 300032300130333122113111 |
5 | 210300334414241344312 |
6 | 2031050422422454101 |
7 | 62452121356546135 |
oct | 6016603477322725 |
9 | 1024044577073711 |
10 | 212120331199957 |
11 | 616517aaaa6744 |
12 | 1b95a411894331 |
13 | 9148b27668b1b |
14 | 3a54970920ac5 |
15 | 197cb0b088a57 |
hex | c0ec1cfda5d5 |
212120331199957 has 2 divisors, whose sum is σ = 212120331199958. Its totient is φ = 212120331199956.
The previous prime is 212120331199867. The next prime is 212120331200039. The reversal of 212120331199957 is 759991133021212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121487151338641 + 90633179861316 = 11022121^2 + 9520146^2 .
It is a cyclic number.
It is not a de Polignac number, because 212120331199957 - 247 = 71382842844629 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212120331199898 and 212120331199907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212120331199457) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106060165599978 + 106060165599979.
It is an arithmetic number, because the mean of its divisors is an integer number (106060165599979).
Almost surely, 2212120331199957 is an apocalyptic number.
It is an amenable number.
212120331199957 is a deficient number, since it is larger than the sum of its proper divisors (1).
212120331199957 is an equidigital number, since it uses as much as digits as its factorization.
212120331199957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1837080, while the sum is 55.
The spelling of 212120331199957 in words is "two hundred twelve trillion, one hundred twenty billion, three hundred thirty-one million, one hundred ninety-nine thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •