Base | Representation |
---|---|
bin | 1100010101110001000… |
… | …1100101111101100001 |
3 | 202021012202020201201111 |
4 | 3011130101211331201 |
5 | 11433134341411223 |
6 | 241220412103321 |
7 | 21213411062512 |
oct | 3053421457541 |
9 | 667182221644 |
10 | 212001513313 |
11 | 81a00366847 |
12 | 35106a64b41 |
13 | 16cb7893745 |
14 | a391db4a09 |
15 | 57abde330d |
hex | 315c465f61 |
212001513313 has 2 divisors, whose sum is σ = 212001513314. Its totient is φ = 212001513312.
The previous prime is 212001513263. The next prime is 212001513337. The reversal of 212001513313 is 313315100212.
212001513313 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 184992891664 + 27008621649 = 430108^2 + 164343^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212001513313 is a prime.
It is not a weakly prime, because it can be changed into another prime (212001513343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106000756656 + 106000756657.
It is an arithmetic number, because the mean of its divisors is an integer number (106000756657).
Almost surely, 2212001513313 is an apocalyptic number.
It is an amenable number.
212001513313 is a deficient number, since it is larger than the sum of its proper divisors (1).
212001513313 is an equidigital number, since it uses as much as digits as its factorization.
212001513313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 22.
Adding to 212001513313 its reverse (313315100212), we get a palindrome (525316613525).
The spelling of 212001513313 in words is "two hundred twelve billion, one million, five hundred thirteen thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •