Search a number
-
+
11022101020121 is a prime number
BaseRepresentation
bin1010000001100100100001…
…1010100111110111011001
31110000200222011121211100012
42200121020122213313121
52421041230330120441
635235252221051305
72215214636563322
oct240311032476731
943020864554305
1011022101020121
11356a4a07534a4
1212a01a73b6b35
1361c4c2185c59
142a16888d1449
15141a9bade9eb
hexa06486a7dd9

11022101020121 has 2 divisors, whose sum is σ = 11022101020122. Its totient is φ = 11022101020120.

The previous prime is 11022101020097. The next prime is 11022101020127. The reversal of 11022101020121 is 12102010122011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9505104811225 + 1516996208896 = 3083035^2 + 1231664^2 .

It is a cyclic number.

It is not a de Polignac number, because 11022101020121 - 230 = 11021027278297 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 11022101020096 and 11022101020105.

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

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

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

Almost surely, 211022101020121 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16, while the sum is 14.

Adding to 11022101020121 its reverse (12102010122011), we get a palindrome (23124111142132).

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