Search a number
-
+
9516013369 is a prime number
BaseRepresentation
bin10001101110011001…
…01101011100111001
3220120012001120021121
420313030231130321
5123442044411434
64212133105241
7454546531132
oct106714553471
926505046247
109516013369
1140435a5765
121a16a88221
13b88651055
14663b78c89
153aa6597b4
hex23732d739

9516013369 has 2 divisors, whose sum is σ = 9516013370. Its totient is φ = 9516013368.

The previous prime is 9516013361. The next prime is 9516013457. The reversal of 9516013369 is 9633106159.

9516013369 is digitally balanced in base 3, 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., 9040206400 + 475806969 = 95080^2 + 21813^2 .

It is a cyclic number.

It is not a de Polignac number, because 9516013369 - 23 = 9516013361 is a prime.

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

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

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

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

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

Almost surely, 29516013369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 131220, while the sum is 43.

The square root of 9516013369 is about 97550.0557098765. The cubic root of 9516013369 is about 2119.1011207242.

The spelling of 9516013369 in words is "nine billion, five hundred sixteen million, thirteen thousand, three hundred sixty-nine".