Search a number
-
+
6500315137 is a prime number
BaseRepresentation
bin1100000110111001…
…01111000000000001
3121210000111020000111
412003130233000001
5101303040041022
62553004151321
7320040524041
oct60334570001
917700436014
106500315137
112836292a78
121314b38541
137c7931424
14459447721
15280a14477
hex18372f001

6500315137 has 2 divisors, whose sum is σ = 6500315138. Its totient is φ = 6500315136.

The previous prime is 6500315089. The next prime is 6500315183. The reversal of 6500315137 is 7315130056.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 4291691121 + 2208624016 = 65511^2 + 46996^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×65003151372 = 84508193760622657538, which contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 6500315099 and 6500315108.

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

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

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

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

Almost surely, 26500315137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 31.

The square root of 6500315137 is about 80624.5318560052. The cubic root of 6500315137 is about 1866.2857382384.

The spelling of 6500315137 in words is "six billion, five hundred million, three hundred fifteen thousand, one hundred thirty-seven".