Search a number
-
+
212520514054313 is a prime number
BaseRepresentation
bin110000010100100101001001…
…101111110110100010101001
31000212110202121000201210210202
4300110211021233312202221
5210323414003044214223
62031554324254121545
762523046311644213
oct6024451157664251
91025422530653722
10212520514054313
1161796497870243
121ba03a961b02b5
1391777a1b3a2ba
143a6a0950c15b3
15198822da51428
hexc14949bf68a9

212520514054313 has 2 divisors, whose sum is σ = 212520514054314. Its totient is φ = 212520514054312.

The previous prime is 212520514054283. The next prime is 212520514054361. The reversal of 212520514054313 is 313450415025212.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 175631751327769 + 36888762726544 = 13252613^2 + 6073612^2 .

It is a cyclic number.

It is not a de Polignac number, because 212520514054313 - 26 = 212520514054249 is a prime.

It is not a weakly prime, because it can be changed into another prime (212520514054613) 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, 106260257027156 + 106260257027157.

It is an arithmetic number, because the mean of its divisors is an integer number (106260257027157).

Almost surely, 2212520514054313 is an apocalyptic number.

It is an amenable number.

212520514054313 is a deficient number, since it is larger than the sum of its proper divisors (1).

212520514054313 is an equidigital number, since it uses as much as digits as its factorization.

212520514054313 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 144000, while the sum is 38.

Adding to 212520514054313 its reverse (313450415025212), we get a palindrome (525970929079525).

The spelling of 212520514054313 in words is "two hundred twelve trillion, five hundred twenty billion, five hundred fourteen million, fifty-four thousand, three hundred thirteen".