Search a number
-
+
1101120021122 = 21150050910051
BaseRepresentation
bin10000000001011111110…
…111100010001010000010
310220021011221120201212112
4100001133313202022002
5121020043211133442
62201503023255322
7142360531515152
oct20013767421202
93807157521775
101101120021122
11394a89600490
121594a2a4a542
137cab1b48b74
143b41a138762
151d998e8e082
hex1005fde2282

1101120021122 has 8 divisors (see below), whose sum is σ = 1801832761872. Its totient is φ = 500509100500.

The previous prime is 1101120021097. The next prime is 1101120021191. The reversal of 1101120021122 is 2211200211011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a super-2 number, since 2×11011200211222 (a number of 25 digits) contains 22 as substring.

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

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 in 3 ways as a sum of consecutive naturals, for example, 25025455004 + ... + 25025455047.

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

Almost surely, 21101120021122 is an apocalyptic number.

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

1101120021122 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 50050910064.

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

Adding to 1101120021122 its reverse (2211200211011), we get a palindrome (3312320232133).

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

Divisors: 1 2 11 22 50050910051 100101820102 550560010561 1101120021122