Search a number
-
+
1100022111022 = 2550011055511
BaseRepresentation
bin10000000000011110011…
…011010101101100101110
310220011100102200010100111
4100000132123111230232
5121010321130023042
62201202043250234
7142321400445112
oct20003633255456
93804312603314
101100022111022
1139457589336a
1215923721997a
137c96854a513
143b3543c1742
151d9328bc517
hex1001e6d5b2e

1100022111022 has 4 divisors (see below), whose sum is σ = 1650033166536. Its totient is φ = 550011055510.

The previous prime is 1100022110959. The next prime is 1100022111031. The reversal of 1100022111022 is 2201112200011.

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

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

It is a congruent number.

It is an unprimeable number.

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, 275005527754 + ... + 275005527757.

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

Almost surely, 21100022111022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 550011055513.

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

Adding to 1100022111022 its reverse (2201112200011), we get a palindrome (3301134311033).

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

Divisors: 1 2 550011055511 1100022111022