Base | Representation |
---|---|
bin | 110000000010111111111100… |
… | …111101110000000110011111 |
3 | 1000201012021002022011212002211 |
4 | 300002333330331300012133 |
5 | 210144120133022322033 |
6 | 2025231314320101251 |
7 | 62336545530201664 |
oct | 6002777475600637 |
9 | 1021167068155084 |
10 | 211312340042143 |
11 | 6137007306389a |
12 | 1b8498b7164827 |
13 | 90ba88bc53c02 |
14 | 3a27801153a6b |
15 | 1966abb4462cd |
hex | c02ffcf7019f |
211312340042143 has 8 divisors (see below), whose sum is σ = 216827679045600. Its totient is φ = 205814209585920.
The previous prime is 211312340042119. The next prime is 211312340042149. The reversal of 211312340042143 is 341240043213112.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211312340042143 - 29 = 211312340041631 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211312340042149) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4302111930 + ... + 4302161047.
It is an arithmetic number, because the mean of its divisors is an integer number (27103459880700).
Almost surely, 2211312340042143 is an apocalyptic number.
211312340042143 is a deficient number, since it is larger than the sum of its proper divisors (5515339003457).
211312340042143 is an equidigital number, since it uses as much as digits as its factorization.
211312340042143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8604273617.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 211312340042143 its reverse (341240043213112), we get a palindrome (552552383255255).
The spelling of 211312340042143 in words is "two hundred eleven trillion, three hundred twelve billion, three hundred forty million, forty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •