Base | Representation |
---|---|
bin | 1100011001100101001… |
… | …1000101100110001101 |
3 | 202100212002201020220101 |
4 | 3012121103011212031 |
5 | 11442233440041323 |
6 | 241510143451101 |
7 | 21250652205634 |
oct | 3063123054615 |
9 | 670762636811 |
10 | 213025315213 |
11 | 82386267317 |
12 | 353518b6a91 |
13 | 1711ba15699 |
14 | a44bd5a51b |
15 | 581bc26dad |
hex | 31994c598d |
213025315213 has 2 divisors, whose sum is σ = 213025315214. Its totient is φ = 213025315212.
The previous prime is 213025315211. The next prime is 213025315231. The reversal of 213025315213 is 312513520312.
Together with next prime (213025315231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157960938249 + 55064376964 = 397443^2 + 234658^2 .
It is a cyclic number.
It is not a de Polignac number, because 213025315213 - 21 = 213025315211 is a prime.
Together with 213025315211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213025315211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106512657606 + 106512657607.
It is an arithmetic number, because the mean of its divisors is an integer number (106512657607).
Almost surely, 2213025315213 is an apocalyptic number.
It is an amenable number.
213025315213 is a deficient number, since it is larger than the sum of its proper divisors (1).
213025315213 is an equidigital number, since it uses as much as digits as its factorization.
213025315213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 213025315213 its reverse (312513520312), we get a palindrome (525538835525).
The spelling of 213025315213 in words is "two hundred thirteen billion, twenty-five million, three hundred fifteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •