Base | Representation |
---|---|
bin | 110000001111000110100111… |
… | …110000101100110110110011 |
3 | 1000211010210002110122211020122 |
4 | 300033012213300230312303 |
5 | 210301232141324304133 |
6 | 2031105400404000455 |
7 | 62453623261041554 |
oct | 6017064760546663 |
9 | 1024123073584218 |
10 | 212144134213043 |
11 | 616609051a478a |
12 | 1b962b5539012b |
13 | 914b14bbc4456 |
14 | 3a55b8bd2032b |
15 | 197d550b18498 |
hex | c0f1a7c2cdb3 |
212144134213043 has 2 divisors, whose sum is σ = 212144134213044. Its totient is φ = 212144134213042.
The previous prime is 212144134213013. The next prime is 212144134213061. The reversal of 212144134213043 is 340312431441212.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 212144134213043 - 26 = 212144134212979 is a prime.
It is a super-2 number, since 2×2121441342130432 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212144134212994 and 212144134213012.
It is not a weakly prime, because it can be changed into another prime (212144134213013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106072067106521 + 106072067106522.
It is an arithmetic number, because the mean of its divisors is an integer number (106072067106522).
Almost surely, 2212144134213043 is an apocalyptic number.
212144134213043 is a deficient number, since it is larger than the sum of its proper divisors (1).
212144134213043 is an equidigital number, since it uses as much as digits as its factorization.
212144134213043 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55296, while the sum is 35.
Adding to 212144134213043 its reverse (340312431441212), we get a palindrome (552456565654255).
The spelling of 212144134213043 in words is "two hundred twelve trillion, one hundred forty-four billion, one hundred thirty-four million, two hundred thirteen thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •