Search a number
-
+
11215015139 is a prime number
BaseRepresentation
bin10100111000111011…
…11000110011100011
31001221121000210120002
422130131320303203
5140432020441024
65052504410215
7544630025066
oct123435706343
931847023502
1011215015139
114835646959
12220ba7696b
13109963b143
147856808dd
154598b26ae
hex29c778ce3

11215015139 has 2 divisors, whose sum is σ = 11215015140. Its totient is φ = 11215015138.

The previous prime is 11215015067. The next prime is 11215015171. The reversal of 11215015139 is 93151051211.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11215015139 - 220 = 11213966563 is a prime.

It is a Sophie Germain prime.

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

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

Almost surely, 211215015139 is an apocalyptic number.

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

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

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

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

The spelling of 11215015139 in words is "eleven billion, two hundred fifteen million, fifteen thousand, one hundred thirty-nine".