Search a number
-
+
12645523737013 is a prime number
BaseRepresentation
bin1011100000000100001111…
…1100110100100110110101
31122202220022021212121110111
42320001003330310212311
53124141013034041023
642521135020023021
72443415603154616
oct270010374644665
948686267777414
1012645523737013
114035a33532852
121502954391a71
1370961090468b
1431a091ca5c0d
1516de1468300d
hexb8043f349b5

12645523737013 has 2 divisors, whose sum is σ = 12645523737014. Its totient is φ = 12645523737012.

The previous prime is 12645523736947. The next prime is 12645523737031. The reversal of 12645523737013 is 31073732554621.

Together with next prime (12645523737031) 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., 12344668196004 + 300855541009 = 3513498^2 + 548503^2 .

It is a cyclic number.

It is not a de Polignac number, because 12645523737013 - 29 = 12645523736501 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (12645523738013) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6322761868506 + 6322761868507.

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

Almost surely, 212645523737013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3175200, while the sum is 49.

The spelling of 12645523737013 in words is "twelve trillion, six hundred forty-five billion, five hundred twenty-three million, seven hundred thirty-seven thousand, thirteen".