Search a number
-
+
11022002110001 is a prime number
BaseRepresentation
bin1010000001100100001010…
…0001010011111000110001
31110000200201021111200011102
42200121002201103320301
52421041030020010001
635235234325054145
72215212326060531
oct240310241237061
943020637450142
1011022002110001
11356a44a9368a3
1212a017a257355
1361c4a783455c
142a16797054c1
15141a930a2e6b
hexa0642853e31

11022002110001 has 2 divisors, whose sum is σ = 11022002110002. Its totient is φ = 11022002110000.

The previous prime is 11022002109983. The next prime is 11022002110057. The reversal of 11022002110001 is 10001120022011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 7528657945600 + 3493344164401 = 2743840^2 + 1869049^2 .

It is a cyclic number.

It is not a de Polignac number, because 11022002110001 - 226 = 11021935001137 is a prime.

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

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

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

Almost surely, 211022002110001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8, while the sum is 11.

Adding to 11022002110001 its reverse (10001120022011), we get a palindrome (21023122132012).

The spelling of 11022002110001 in words is "eleven trillion, twenty-two billion, two million, one hundred ten thousand, one".