Base | Representation |
---|---|
bin | 110000001111000101101100… |
… | …101111011000010011001101 |
3 | 1000211010200112110102100100022 |
4 | 300033011230233120103031 |
5 | 210301223124331322312 |
6 | 2031105114232311525 |
7 | 62453556605336165 |
oct | 6017055457302315 |
9 | 1024120473370308 |
10 | 212143144010957 |
11 | 61660447263255 |
12 | 1b9629198425a5 |
13 | 914b021a07b63 |
14 | 3a55ad66035a5 |
15 | 197d4e3c20172 |
hex | c0f16cbd84cd |
212143144010957 has 2 divisors, whose sum is σ = 212143144010958. Its totient is φ = 212143144010956.
The previous prime is 212143144010947. The next prime is 212143144011089. The reversal of 212143144010957 is 759010441341212.
212143144010957 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197033045627716 + 15110098383241 = 14036846^2 + 3887171^2 .
It is a cyclic number.
It is not a de Polignac number, because 212143144010957 - 212 = 212143144006861 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212143144010947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106071572005478 + 106071572005479.
It is an arithmetic number, because the mean of its divisors is an integer number (106071572005479).
Almost surely, 2212143144010957 is an apocalyptic number.
It is an amenable number.
212143144010957 is a deficient number, since it is larger than the sum of its proper divisors (1).
212143144010957 is an equidigital number, since it uses as much as digits as its factorization.
212143144010957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 241920, while the sum is 44.
The spelling of 212143144010957 in words is "two hundred twelve trillion, one hundred forty-three billion, one hundred forty-four million, ten thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •