Search a number
-
+
2503758742913 is a prime number
BaseRepresentation
bin100100011011110011101…
…001101000010110000001
322212100122020210111011002
4210123303221220112001
5312010144214233123
65154113315101345
7345614322111521
oct44336351502601
98770566714132
102503758742913
118859245a048a
123452b38a1855
1315214633277c
148927ad85681
15451ddacc528
hex246f3a68581

2503758742913 has 2 divisors, whose sum is σ = 2503758742914. Its totient is φ = 2503758742912.

The previous prime is 2503758742787. The next prime is 2503758742931. The reversal of 2503758742913 is 3192478573052.

Together with next prime (2503758742931) 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., 1370847572224 + 1132911170689 = 1170832^2 + 1064383^2 .

It is a cyclic number.

It is not a de Polignac number, because 2503758742913 - 28 = 2503758742657 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 22503758742913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12700800, while the sum is 56.

The spelling of 2503758742913 in words is "two trillion, five hundred three billion, seven hundred fifty-eight million, seven hundred forty-two thousand, nine hundred thirteen".