Search a number
-
+
6507134757913 is a prime number
BaseRepresentation
bin101111010110000111101…
…1101001010110000011001
3212001002001102001112000211
41132230033131022300121
51323103102444223123
621501200400531121
71241060602555156
oct136541735126031
925032042045024
106507134757913
112089729a26099
12891162320aa1
1338280a6a6aca
14186d3880b22d
15b43eb15340d
hex5eb0f74ac19

6507134757913 has 2 divisors, whose sum is σ = 6507134757914. Its totient is φ = 6507134757912.

The previous prime is 6507134757869. The next prime is 6507134757919. The reversal of 6507134757913 is 3197574317056.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5193330516544 + 1313804241369 = 2278888^2 + 1146213^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-6507134757913 is a prime.

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

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

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

Almost surely, 26507134757913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 6507134757913 in words is "six trillion, five hundred seven billion, one hundred thirty-four million, seven hundred fifty-seven thousand, nine hundred thirteen".