Search a number
-
+
15216136513 is a prime number
BaseRepresentation
bin11100010101111001…
…11101000101000001
31110021102211211020121
432022330331011001
5222130312332023
610553514340241
71046033012014
oct161274750501
943242754217
1015216136513
1164a9126636
122b47a2a681
131586563096
14a44c0737b
155e0ca9d5d
hex38af3d141

15216136513 has 2 divisors, whose sum is σ = 15216136514. Its totient is φ = 15216136512.

The previous prime is 15216136487. The next prime is 15216136591. The reversal of 15216136513 is 31563161251.

15216136513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9375661584 + 5840474929 = 96828^2 + 76423^2 .

It is an emirp because it is prime and its reverse (31563161251) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 15216136513 - 225 = 15182582081 is a prime.

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

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

Almost surely, 215216136513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 16200, while the sum is 34.

Adding to 15216136513 its reverse (31563161251), we get a palindrome (46779297764).

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