Base | Representation |
---|---|
bin | 110000001111110100111111… |
… | …111000110111100010011101 |
3 | 1000211022112121220100100201201 |
4 | 300033310333320313202131 |
5 | 210303041132332143122 |
6 | 2031144313552435501 |
7 | 62460335265622522 |
oct | 6017647770674235 |
9 | 1024275556310651 |
10 | 212193931131037 |
11 | 6167aa3926a269 |
12 | 1b970732248b91 |
13 | 9152a5686b0bb |
14 | 3a583536a9149 |
15 | 197e9b7745a27 |
hex | c0fd3fe3789d |
212193931131037 has 2 divisors, whose sum is σ = 212193931131038. Its totient is φ = 212193931131036.
The previous prime is 212193931130959. The next prime is 212193931131041. The reversal of 212193931131037 is 730131139391212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175756904787556 + 36437026343481 = 13257334^2 + 6036309^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212193931131037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212193931531037) 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, 106096965565518 + 106096965565519.
It is an arithmetic number, because the mean of its divisors is an integer number (106096965565519).
Almost surely, 2212193931131037 is an apocalyptic number.
It is an amenable number.
212193931131037 is a deficient number, since it is larger than the sum of its proper divisors (1).
212193931131037 is an equidigital number, since it uses as much as digits as its factorization.
212193931131037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 183708, while the sum is 46.
The spelling of 212193931131037 in words is "two hundred twelve trillion, one hundred ninety-three billion, nine hundred thirty-one million, one hundred thirty-one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •