Base | Representation |
---|---|
bin | 110000001100100110011001… |
… | …010000010011100111110101 |
3 | 1000210112100000120011101210121 |
4 | 300030212121100103213311 |
5 | 210240422321042220323 |
6 | 2030454345041251541 |
7 | 62435323022443615 |
oct | 6014463120234765 |
9 | 1023470016141717 |
10 | 211972092148213 |
11 | 615a494aa0a031 |
12 | 1b935740933bb1 |
13 | 9137b61b856a7 |
14 | 3a4b70ad9ca45 |
15 | 1978d31d9ba5d |
hex | c0c9994139f5 |
211972092148213 has 2 divisors, whose sum is σ = 211972092148214. Its totient is φ = 211972092148212.
The previous prime is 211972092148081. The next prime is 211972092148321. The reversal of 211972092148213 is 312841290279112.
It is a happy number.
Together with next prime (211972092148321) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175628279160324 + 36343812987889 = 13252482^2 + 6028583^2 .
It is a cyclic number.
It is not a de Polignac number, because 211972092148213 - 213 = 211972092140021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211972092145213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105986046074106 + 105986046074107.
It is an arithmetic number, because the mean of its divisors is an integer number (105986046074107).
Almost surely, 2211972092148213 is an apocalyptic number.
It is an amenable number.
211972092148213 is a deficient number, since it is larger than the sum of its proper divisors (1).
211972092148213 is an equidigital number, since it uses as much as digits as its factorization.
211972092148213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 870912, while the sum is 52.
The spelling of 211972092148213 in words is "two hundred eleven trillion, nine hundred seventy-two billion, ninety-two million, one hundred forty-eight thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •