Base | Representation |
---|---|
bin | 110000000011011001110110… |
… | …001101011011101111011001 |
3 | 1000201021220212000020020221022 |
4 | 300003121312031123233121 |
5 | 210200044103330444321 |
6 | 2025252153303252225 |
7 | 62341551533014334 |
oct | 6003316615335731 |
9 | 1021256760206838 |
10 | 211340143999961 |
11 | 61380940730929 |
12 | 1b85317674a075 |
13 | 90c03a0371c62 |
14 | 3a28cbba7161b |
15 | 1967697385dab |
hex | c0367635bbd9 |
211340143999961 has 2 divisors, whose sum is σ = 211340143999962. Its totient is φ = 211340143999960.
The previous prime is 211340143999903. The next prime is 211340144000047. The reversal of 211340143999961 is 169999341043112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 136160076625225 + 75180067374736 = 11668765^2 + 8670644^2 .
It is a cyclic number.
It is not a de Polignac number, because 211340143999961 - 222 = 211340139805657 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 211340143999894 and 211340143999903.
It is not a weakly prime, because it can be changed into another prime (211340143999561) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105670071999980 + 105670071999981.
It is an arithmetic number, because the mean of its divisors is an integer number (105670071999981).
Almost surely, 2211340143999961 is an apocalyptic number.
It is an amenable number.
211340143999961 is a deficient number, since it is larger than the sum of its proper divisors (1).
211340143999961 is an equidigital number, since it uses as much as digits as its factorization.
211340143999961 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11337408, while the sum is 62.
The spelling of 211340143999961 in words is "two hundred eleven trillion, three hundred forty billion, one hundred forty-three million, nine hundred ninety-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •