Search a number
-
+
214320511513 is a prime number
BaseRepresentation
bin1100011110011001111…
…1110111101000011001
3202111012100212001012201
43013212133313220121
512002412022332023
6242242452210201
721325030201303
oct3074637675031
9674170761181
10214320511513
1182990383489
1235653609961
131729715b024
14a531d8a973
1558957b8bad
hex31e67f7a19

214320511513 has 2 divisors, whose sum is σ = 214320511514. Its totient is φ = 214320511512.

The previous prime is 214320511511. The next prime is 214320511649. The reversal of 214320511513 is 315115023412.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 211979209744 + 2341301769 = 460412^2 + 48387^2 .

It is a cyclic number.

It is not a de Polignac number, because 214320511513 - 21 = 214320511511 is a prime.

It is a super-3 number, since 3×2143205115133 (a number of 35 digits) contains 333 as substring.

Together with 214320511511, it forms a pair of twin primes.

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

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

Almost surely, 2214320511513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3600, while the sum is 28.

Adding to 214320511513 its reverse (315115023412), we get a palindrome (529435534925).

The spelling of 214320511513 in words is "two hundred fourteen billion, three hundred twenty million, five hundred eleven thousand, five hundred thirteen".