Base | Representation |
---|---|
bin | 1100010111101100101… |
… | …1011101101011011101 |
3 | 202022112212212121001022 |
4 | 3011323023131223131 |
5 | 11440220110001341 |
6 | 241344053053525 |
7 | 21232305124244 |
oct | 3057313355335 |
9 | 668485777038 |
10 | 212520000221 |
11 | 82146aaa721 |
12 | 352306272a5 |
13 | 1706b11c329 |
14 | a400bbd95b |
15 | 57dc6ade4b |
hex | 317b2ddadd |
212520000221 has 2 divisors, whose sum is σ = 212520000222. Its totient is φ = 212520000220.
The previous prime is 212520000197. The next prime is 212520000223. The reversal of 212520000221 is 122000025212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195263236996 + 17256763225 = 441886^2 + 131365^2 .
It is a cyclic number.
It is not a de Polignac number, because 212520000221 - 218 = 212519738077 is a prime.
Together with 212520000223, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212520000221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212520000223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106260000110 + 106260000111.
It is an arithmetic number, because the mean of its divisors is an integer number (106260000111).
Almost surely, 2212520000221 is an apocalyptic number.
It is an amenable number.
212520000221 is a deficient number, since it is larger than the sum of its proper divisors (1).
212520000221 is an equidigital number, since it uses as much as digits as its factorization.
212520000221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 160, while the sum is 17.
Adding to 212520000221 its reverse (122000025212), we get a palindrome (334520025433).
The spelling of 212520000221 in words is "two hundred twelve billion, five hundred twenty million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •