Base | Representation |
---|---|
bin | 110000100000011000001010… |
… | …011101111001010010110101 |
3 | 1000222100021010012121212102101 |
4 | 300200120022131321102311 |
5 | 210430204300001420313 |
6 | 2033415000105142101 |
7 | 62635446016001245 |
oct | 6040301235712265 |
9 | 1028307105555371 |
10 | 213331201201333 |
11 | 61a792885aa746 |
12 | 1bb1502378a931 |
13 | 9206079c631b7 |
14 | 3a973dc959b25 |
15 | 199e37a1d55dd |
hex | c2060a7794b5 |
213331201201333 has 2 divisors, whose sum is σ = 213331201201334. Its totient is φ = 213331201201332.
The previous prime is 213331201201277. The next prime is 213331201201337. The reversal of 213331201201333 is 333102102133312.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114126852222289 + 99204348979044 = 10683017^2 + 9960138^2 .
It is a cyclic number.
It is not a de Polignac number, because 213331201201333 - 217 = 213331201070261 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213331201201337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106665600600666 + 106665600600667.
It is an arithmetic number, because the mean of its divisors is an integer number (106665600600667).
Almost surely, 2213331201201333 is an apocalyptic number.
It is an amenable number.
213331201201333 is a deficient number, since it is larger than the sum of its proper divisors (1).
213331201201333 is an equidigital number, since it uses as much as digits as its factorization.
213331201201333 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 213331201201333 its reverse (333102102133312), we get a palindrome (546433303334645).
The spelling of 213331201201333 in words is "two hundred thirteen trillion, three hundred thirty-one billion, two hundred one million, two hundred one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •