Base | Representation |
---|---|
bin | 1100011010010011111… |
… | …0101111111100110001 |
3 | 202101100202111211120002 |
4 | 3012210332233330301 |
5 | 11443134123412012 |
6 | 241541424355345 |
7 | 21255552143024 |
oct | 3064476577461 |
9 | 671322454502 |
10 | 213221310257 |
11 | 8247696429a |
12 | 353a7475b55 |
13 | 171504c9a97 |
14 | a469db91bb |
15 | 582e03e7c2 |
hex | 31a4faff31 |
213221310257 has 2 divisors, whose sum is σ = 213221310258. Its totient is φ = 213221310256.
The previous prime is 213221310209. The next prime is 213221310259. The reversal of 213221310257 is 752013122312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 191752906816 + 21468403441 = 437896^2 + 146521^2 .
It is a cyclic number.
It is not a de Polignac number, because 213221310257 - 222 = 213217115953 is a prime.
Together with 213221310259, 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 (213221310259) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106610655128 + 106610655129.
It is an arithmetic number, because the mean of its divisors is an integer number (106610655129).
Almost surely, 2213221310257 is an apocalyptic number.
It is an amenable number.
213221310257 is a deficient number, since it is larger than the sum of its proper divisors (1).
213221310257 is an equidigital number, since it uses as much as digits as its factorization.
213221310257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 29.
Adding to 213221310257 its reverse (752013122312), we get a palindrome (965234432569).
The spelling of 213221310257 in words is "two hundred thirteen billion, two hundred twenty-one million, three hundred ten thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •