Base | Representation |
---|---|
bin | 1100010111010101001… |
… | …0010010000001110101 |
3 | 202022021222211011122221 |
4 | 3011311102102001311 |
5 | 11440014301433323 |
6 | 241330201522341 |
7 | 21226664523064 |
oct | 3056522220165 |
9 | 668258734587 |
10 | 212421124213 |
11 | 820a6206711 |
12 | 352034a33b1 |
13 | 170537b030c |
14 | a3d1a021db |
15 | 57d3b7c55d |
hex | 3175492075 |
212421124213 has 2 divisors, whose sum is σ = 212421124214. Its totient is φ = 212421124212.
The previous prime is 212421124193. The next prime is 212421124243. The reversal of 212421124213 is 312421124212.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 128678603524 + 83742520689 = 358718^2 + 289383^2 .
It is a cyclic number.
It is not a de Polignac number, because 212421124213 - 213 = 212421116021 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212421124243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106210562106 + 106210562107.
It is an arithmetic number, because the mean of its divisors is an integer number (106210562107).
Almost surely, 2212421124213 is an apocalyptic number.
It is an amenable number.
212421124213 is a deficient number, since it is larger than the sum of its proper divisors (1).
212421124213 is an equidigital number, since it uses as much as digits as its factorization.
212421124213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1536, while the sum is 25.
Adding to 212421124213 its reverse (312421124212), we get a palindrome (524842248425).
Subtracting 212421124213 from its reverse (312421124212), we obtain a palindrome (99999999999).
The spelling of 212421124213 in words is "two hundred twelve billion, four hundred twenty-one million, one hundred twenty-four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •