Search a number
-
+
11015121300509 is a prime number
BaseRepresentation
bin1010000001001010100001…
…1001000110110000011101
31110000000221202001100000102
42200102220121012300131
52420432432023104014
635232135445310445
72214546655131464
oct240225031066035
943000852040012
1011015121300509
1135675398a0887
12129a979a05425
1361b94c130c51
142a11c59339db
151417dde7e8de
hexa04a8646c1d

11015121300509 has 2 divisors, whose sum is σ = 11015121300510. Its totient is φ = 11015121300508.

The previous prime is 11015121300461. The next prime is 11015121300527. The reversal of 11015121300509 is 90500312151011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10995126492100 + 19994808409 = 3315890^2 + 141403^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11015121300509 is a prime.

It is a congruent number.

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

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

Almost surely, 211015121300509 is an apocalyptic number.

It is an amenable number.

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

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

11015121300509 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 11015121300509 in words is "eleven trillion, fifteen billion, one hundred twenty-one million, three hundred thousand, five hundred nine".