Search a number
-
+
1100211021122 = 2550105510561
BaseRepresentation
bin10000000000101001101…
…011111110010101000010
310220011211121010202021212
4100000221223332111002
5121011213010133442
62201232512250122
7142326153243323
oct20005153762502
93804747122255
101100211021122
11394662491314
1215928a540942
137c998720b45
143b37151844a
151d944285a82
hex10029afe542

1100211021122 has 4 divisors (see below), whose sum is σ = 1650316531686. Its totient is φ = 550105510560.

The previous prime is 1100211021073. The next prime is 1100211021223. The reversal of 1100211021122 is 2211201120011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 950626950001 + 149584071121 = 975001^2 + 386761^2 .

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

It is an unprimeable number.

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, 275052755279 + ... + 275052755282.

Almost surely, 21100211021122 is an apocalyptic number.

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

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

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

The sum of its prime factors is 550105510563.

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

Adding to 1100211021122 its reverse (2211201120011), we get a palindrome (3311412141133).

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

Divisors: 1 2 550105510561 1100211021122