Search a number
-
+
6515105231 is a prime number
BaseRepresentation
bin1100001000101010…
…01001110111001111
3121211001022122012202
412010111021313033
5101320331331411
62554253152115
7320310323615
oct60425116717
917731278182
106515105231
112843674a98
121319a8b63b
137caa0c36b
1445b3b76b5
15281e8683b
hex184549dcf

6515105231 has 2 divisors, whose sum is σ = 6515105232. Its totient is φ = 6515105230.

The previous prime is 6515105221. The next prime is 6515105237. The reversal of 6515105231 is 1325015156.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 6515105231 - 26 = 6515105167 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 26515105231 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 29.

The square root of 6515105231 is about 80716.2017874974. The cubic root of 6515105231 is about 1867.7001124011.

The spelling of 6515105231 in words is "six billion, five hundred fifteen million, one hundred five thousand, two hundred thirty-one".