Base | Representation |
---|---|
bin | 110000001011001011110110… |
… | …100100101111101101000101 |
3 | 1000210012001002020012100222012 |
4 | 300023023312210233231011 |
5 | 210232324220111230042 |
6 | 2030341550113144005 |
7 | 62425311611060405 |
oct | 6013136644575505 |
9 | 1023161066170865 |
10 | 211874873539397 |
11 | 615676a1601332 |
12 | 1b91a92a55b005 |
13 | 912b93a689063 |
14 | 3a46b274ba805 |
15 | 1976541e22e82 |
hex | c0b2f692fb45 |
211874873539397 has 2 divisors, whose sum is σ = 211874873539398. Its totient is φ = 211874873539396.
The previous prime is 211874873539337. The next prime is 211874873539451. The reversal of 211874873539397 is 793935378478112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189384221749636 + 22490651789761 = 13761694^2 + 4742431^2 .
It is a cyclic number.
It is not a de Polignac number, because 211874873539397 - 246 = 141506129361733 is a prime.
It is a super-2 number, since 2×2118748735393972 (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 (211874873539337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105937436769698 + 105937436769699.
It is an arithmetic number, because the mean of its divisors is an integer number (105937436769699).
Almost surely, 2211874873539397 is an apocalyptic number.
It is an amenable number.
211874873539397 is a deficient number, since it is larger than the sum of its proper divisors (1).
211874873539397 is an equidigital number, since it uses as much as digits as its factorization.
211874873539397 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1920360960, while the sum is 77.
The spelling of 211874873539397 in words is "two hundred eleven trillion, eight hundred seventy-four billion, eight hundred seventy-three million, five hundred thirty-nine thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •