Search a number
-
+
1100102221021 is a prime number
BaseRepresentation
bin10000000000100011001…
…100111011110011011101
310220011120000102010121111
4100000203030323303131
5121011002132033041
62201214024302021
7142323362410006
oct20004314736335
93804500363544
101100102221021
1139460702a181
1215925a011911
137c97c01899b
143b360cb61ad
151d939943981
hex1002333bcdd

1100102221021 has 2 divisors, whose sum is σ = 1100102221022. Its totient is φ = 1100102221020.

The previous prime is 1100102221013. The next prime is 1100102221033. The reversal of 1100102221021 is 1201222010011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 758491195396 + 341611025625 = 870914^2 + 584475^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100102221021 - 23 = 1100102221013 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 21100102221021 is an apocalyptic number.

It is an amenable number.

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

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

1100102221021 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 13.

Adding to 1100102221021 its reverse (1201222010011), we get a palindrome (2301324231032).

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