Base | Representation |
---|---|
bin | 1100010111010011000… |
… | …1000101000011011001 |
3 | 202022021101102222011021 |
4 | 3011310301011003121 |
5 | 11440010034422223 |
6 | 241325251202441 |
7 | 21226530532222 |
oct | 3056461050331 |
9 | 668241388137 |
10 | 212412420313 |
11 | 820a1301305 |
12 | 352005a6421 |
13 | 17051a53692 |
14 | a3d07b8249 |
15 | 57d300d65d |
hex | 3174c450d9 |
212412420313 has 2 divisors, whose sum is σ = 212412420314. Its totient is φ = 212412420312.
The previous prime is 212412420289. The next prime is 212412420331. The reversal of 212412420313 is 313024214212.
Together with next prime (212412420331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 126585100944 + 85827319369 = 355788^2 + 292963^2 .
It is a cyclic number.
It is not a de Polignac number, because 212412420313 - 217 = 212412289241 is a prime.
It is not a weakly prime, because it can be changed into another prime (212412420343) 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, 106206210156 + 106206210157.
It is an arithmetic number, because the mean of its divisors is an integer number (106206210157).
Almost surely, 2212412420313 is an apocalyptic number.
It is an amenable number.
212412420313 is a deficient number, since it is larger than the sum of its proper divisors (1).
212412420313 is an equidigital number, since it uses as much as digits as its factorization.
212412420313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 212412420313 its reverse (313024214212), we get a palindrome (525436634525).
The spelling of 212412420313 in words is "two hundred twelve billion, four hundred twelve million, four hundred twenty thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •