Base | Representation |
---|---|
bin | 110000100000011000001010… |
… | …011101111001011111001011 |
3 | 1000222100021010012121220111122 |
4 | 300200120022131321133023 |
5 | 210430204300001431443 |
6 | 2033415000105145455 |
7 | 62635446016003454 |
oct | 6040301235713713 |
9 | 1028307105556448 |
10 | 213331201202123 |
11 | 61a792886002a4 |
12 | 1bb1502378b28b |
13 | 9206079c63674 |
14 | 3a973dc95a12b |
15 | 199e37a1d5968 |
hex | c2060a7797cb |
213331201202123 has 2 divisors, whose sum is σ = 213331201202124. Its totient is φ = 213331201202122.
The previous prime is 213331201202117. The next prime is 213331201202143. The reversal of 213331201202123 is 321202102133312.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 213331201202123 - 210 = 213331201201099 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 213331201202092 and 213331201202101.
It is not a weakly prime, because it can be changed into another prime (213331201202143) 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, 106665600601061 + 106665600601062.
It is an arithmetic number, because the mean of its divisors is an integer number (106665600601062).
Almost surely, 2213331201202123 is an apocalyptic number.
213331201202123 is a deficient number, since it is larger than the sum of its proper divisors (1).
213331201202123 is an equidigital number, since it uses as much as digits as its factorization.
213331201202123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 213331201202123 its reverse (321202102133312), we get a palindrome (534533303335435).
The spelling of 213331201202123 in words is "two hundred thirteen trillion, three hundred thirty-one billion, two hundred one million, two hundred two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •