Search a number
-
+
8515161181361 is a prime number
BaseRepresentation
bin111101111101001011100…
…1010000100110010110001
31010011001010020000221001102
41323322113022010302301
52104003022230300421
630035451104014145
71536125426544542
oct173722712046261
933131106027042
108515161181361
11279329455168a
12b56366301355
13499c8caa3363
142161c92824c9
15eb773aea60b
hex7be97284cb1

8515161181361 has 2 divisors, whose sum is σ = 8515161181362. Its totient is φ = 8515161181360.

The previous prime is 8515161181337. The next prime is 8515161181369. The reversal of 8515161181361 is 1631811615158.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 6985152987136 + 1530008194225 = 2642944^2 + 1236935^2 .

It is a cyclic number.

It is not a de Polignac number, because 8515161181361 - 226 = 8515094072497 is a prime.

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

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 (8515161181369) 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, 4257580590680 + 4257580590681.

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

Almost surely, 28515161181361 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 172800, while the sum is 47.

The spelling of 8515161181361 in words is "eight trillion, five hundred fifteen billion, one hundred sixty-one million, one hundred eighty-one thousand, three hundred sixty-one".