Base | Representation |
---|---|
bin | 110000000010111111101001… |
… | …010011100001010011010011 |
3 | 1000201012020020022112100202001 |
4 | 300002333221103201103103 |
5 | 210144113444103014441 |
6 | 2025231221454334431 |
7 | 62336534413500556 |
oct | 6002775123412323 |
9 | 1021166208470661 |
10 | 211312010204371 |
11 | 6136aa1395a89a |
12 | 1b8498247ba417 |
13 | 90ba838809c2b |
14 | 3a277ad41469d |
15 | 1966a9c4e1731 |
hex | c02fe94e14d3 |
211312010204371 has 2 divisors, whose sum is σ = 211312010204372. Its totient is φ = 211312010204370.
The previous prime is 211312010204357. The next prime is 211312010204431. The reversal of 211312010204371 is 173402010213112.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 211312010204371 - 237 = 211174571250899 is a prime.
It is a super-2 number, since 2×2113120102043712 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (211312010204171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105656005102185 + 105656005102186.
It is an arithmetic number, because the mean of its divisors is an integer number (105656005102186).
Almost surely, 2211312010204371 is an apocalyptic number.
211312010204371 is a deficient number, since it is larger than the sum of its proper divisors (1).
211312010204371 is an equidigital number, since it uses as much as digits as its factorization.
211312010204371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 211312010204371 its reverse (173402010213112), we get a palindrome (384714020417483).
The spelling of 211312010204371 in words is "two hundred eleven trillion, three hundred twelve billion, ten million, two hundred four thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •