Search a number
-
+
11515220309 is a prime number
BaseRepresentation
bin10101011100101110…
…00101000101010101
31002201111220210122002
422232113011011111
5142040344022214
65142351045045
7555233520605
oct125627050525
932644823562
1011515220309
11497a0504aa
122294510785
1311168ab438
147b34a8c05
15475e121de
hex2ae5c5155

11515220309 has 2 divisors, whose sum is σ = 11515220310. Its totient is φ = 11515220308.

The previous prime is 11515220281. The next prime is 11515220323. The reversal of 11515220309 is 90302251511.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9251554225 + 2263666084 = 96185^2 + 47578^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 11515220309 - 212 = 11515216213 is a prime.

It is a congruent number.

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

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

Almost surely, 211515220309 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 11515220309 in words is "eleven billion, five hundred fifteen million, two hundred twenty thousand, three hundred nine".