Search a number
-
+
11002121576813 is a prime number
BaseRepresentation
bin1010000000011010000110…
…0011000110000101101101
31102221210101202202221120102
42200012201203012011231
52420224321110424223
635222145504200445
72213606554244423
oct240064143060555
942853352687512
1011002121576813
113561a78894a84
121298350309125
1361a659b27c53
142a071123b113
151412cca84928
hexa01a18c616d

11002121576813 has 2 divisors, whose sum is σ = 11002121576814. Its totient is φ = 11002121576812.

The previous prime is 11002121576773. The next prime is 11002121576843. The reversal of 11002121576813 is 31867512120011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10855265541289 + 146856035524 = 3294733^2 + 383218^2 .

It is a cyclic number.

It is not a de Polignac number, because 11002121576813 - 220 = 11002120528237 is a prime.

It is a congruent number.

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

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

Almost surely, 211002121576813 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 38.

Adding to 11002121576813 its reverse (31867512120011), we get a palindrome (42869633696824).

The spelling of 11002121576813 in words is "eleven trillion, two billion, one hundred twenty-one million, five hundred seventy-six thousand, eight hundred thirteen".