Search a number
-
+
1370751997513 is a prime number
BaseRepresentation
bin10011111100100111001…
…011111001011001001001
311212001011001201022202111
4103330213023321121021
5134424300002410023
62525414220302321
7201014340506533
oct23744713713111
94761131638674
101370751997513
11489372849108
121a17b20a19a1
139c352288822
144a4b7dd2853
15259ca57a00d
hex13f272f9649

1370751997513 has 2 divisors, whose sum is σ = 1370751997514. Its totient is φ = 1370751997512.

The previous prime is 1370751997451. The next prime is 1370751997529. The reversal of 1370751997513 is 3157991570731.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 771100003129 + 599651994384 = 878123^2 + 774372^2 .

It is a cyclic number.

It is not a de Polignac number, because 1370751997513 - 29 = 1370751997001 is a prime.

It is a super-2 number, since 2×13707519975132 (a number of 25 digits) contains 22 as substring.

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

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

Almost surely, 21370751997513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6251175, while the sum is 58.

The spelling of 1370751997513 in words is "one trillion, three hundred seventy billion, seven hundred fifty-one million, nine hundred ninety-seven thousand, five hundred thirteen".