Base | Representation |
---|---|
bin | 110000011101001010001001… |
… | …110111100000011011010001 |
3 | 1000221120010011100010221021102 |
4 | 300131022021313200123101 |
5 | 210413043240040303012 |
6 | 2033125214350434145 |
7 | 62613455321361203 |
oct | 6035121167403321 |
9 | 1027503140127242 |
10 | 213110000322257 |
11 | 619a3497463285 |
12 | 1ba9a18bb02955 |
13 | 91bb257527a7c |
14 | 3a8a816cb4773 |
15 | 19987308842c2 |
hex | c1d289de06d1 |
213110000322257 has 2 divisors, whose sum is σ = 213110000322258. Its totient is φ = 213110000322256.
The previous prime is 213110000322217. The next prime is 213110000322259. The reversal of 213110000322257 is 752223000011312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 176898538703041 + 36211461619216 = 13300321^2 + 6017596^2 .
It is a cyclic number.
It is not a de Polignac number, because 213110000322257 - 216 = 213110000256721 is a prime.
Together with 213110000322259, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (213110000322259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106555000161128 + 106555000161129.
It is an arithmetic number, because the mean of its divisors is an integer number (106555000161129).
Almost surely, 2213110000322257 is an apocalyptic number.
It is an amenable number.
213110000322257 is a deficient number, since it is larger than the sum of its proper divisors (1).
213110000322257 is an equidigital number, since it uses as much as digits as its factorization.
213110000322257 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 213110000322257 its reverse (752223000011312), we get a palindrome (965333000333569).
The spelling of 213110000322257 in words is "two hundred thirteen trillion, one hundred ten billion, three hundred twenty-two thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •