Base | Representation |
---|---|
bin | 110000011110011110010000… |
… | …111011111010101100011101 |
3 | 1000221212202021101211010002022 |
4 | 300132132100323322230131 |
5 | 210421033220141412112 |
6 | 2033234512145505525 |
7 | 62623133340423416 |
oct | 6036362073725435 |
9 | 1027782241733068 |
10 | 213200313232157 |
11 | 61a28821776199 |
12 | 1bab37956422a5 |
13 | 91c691b118024 |
14 | 3a90d4358680d |
15 | 199ac6941ed72 |
hex | c1e790efab1d |
213200313232157 has 2 divisors, whose sum is σ = 213200313232158. Its totient is φ = 213200313232156.
The previous prime is 213200313232033. The next prime is 213200313232213. The reversal of 213200313232157 is 751232313002312.
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., 204292679023801 + 8907634208356 = 14293099^2 + 2984566^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213200313232157 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213200310232157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106600156616078 + 106600156616079.
It is an arithmetic number, because the mean of its divisors is an integer number (106600156616079).
Almost surely, 2213200313232157 is an apocalyptic number.
It is an amenable number.
213200313232157 is a deficient number, since it is larger than the sum of its proper divisors (1).
213200313232157 is an equidigital number, since it uses as much as digits as its factorization.
213200313232157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45360, while the sum is 35.
Adding to 213200313232157 its reverse (751232313002312), we get a palindrome (964432626234469).
The spelling of 213200313232157 in words is "two hundred thirteen trillion, two hundred billion, three hundred thirteen million, two hundred thirty-two thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •