Search a number
-
+
1100220101021 is a prime number
BaseRepresentation
bin10000000000101010001…
…110100111000110011101
310220011212020020001120102
4100000222032213012131
5121011222321213041
62201233435030445
7142326323361326
oct20005216470635
93804766201512
101100220101021
11394667623168
1215929159b425
137c99a57c972
143b3727dd44d
151d944e7b09b
hex1002a3a719d

1100220101021 has 2 divisors, whose sum is σ = 1100220101022. Its totient is φ = 1100220101020.

The previous prime is 1100220101003. The next prime is 1100220101047. The reversal of 1100220101021 is 1201010220011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 857496372121 + 242723728900 = 926011^2 + 492670^2 .

It is a cyclic number.

It is not a de Polignac number, because 1100220101021 - 222 = 1100215906717 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21100220101021 is an apocalyptic number.

It is an amenable number.

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

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

1100220101021 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 1100220101021 its reverse (1201010220011), we get a palindrome (2301230321032).

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