Search a number
-
+
11002244014121 is a prime number
BaseRepresentation
bin1010000000011010100011…
…0110001010000000101001
31102221210201022011101222112
42200012220312022000221
52420230043431422441
635222210000332105
72213612602036463
oct240065066120051
942853638141875
1011002244014121
113562030a10a38
121298385314035
1361a6792c6369
142a07235cd133
151412d86bc4eb
hexa01a8d8a029

11002244014121 has 2 divisors, whose sum is σ = 11002244014122. Its totient is φ = 11002244014120.

The previous prime is 11002244014081. The next prime is 11002244014123. The reversal of 11002244014121 is 12141044220011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10545996451600 + 456247562521 = 3247460^2 + 675461^2 .

It is a cyclic number.

It is not a de Polignac number, because 11002244014121 - 214 = 11002243997737 is a prime.

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

Together with 11002244014123, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

Almost surely, 211002244014121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 512, while the sum is 23.

Adding to 11002244014121 its reverse (12141044220011), we get a palindrome (23143288234132).

The spelling of 11002244014121 in words is "eleven trillion, two billion, two hundred forty-four million, fourteen thousand, one hundred twenty-one".