Search a number
-
+
1101122211002 = 21124550091781
BaseRepresentation
bin10000000001011111111…
…111111000110010111010
310220021012002200222211012
4100001133333320302322
5121020044241223002
62201503142233522
7142360556235512
oct20013777706272
93807162628735
101101122211002
11394a8a866800
121594a37258a2
137cab2434858
143b41a548842
151d999272d52
hex1005fff8cba

1101122211002 has 12 divisors (see below), whose sum is σ = 1815486621018. Its totient is φ = 500510095800.

The previous prime is 1101122210999. The next prime is 1101122211017. The reversal of 1101122211002 is 2001122211011.

It can be written as a sum of positive squares in only one way, i.e., 970301831521 + 130820379481 = 985039^2 + 361691^2 .

It is a super-3 number, since 3×11011222110023 (a number of 37 digits) contains 333 as substring.

It is an unprimeable number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2275045649 + ... + 2275046132.

Almost surely, 21101122211002 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4550091805 (or 4550091794 counting only the distinct ones).

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

Adding to 1101122211002 its reverse (2001122211011), we get a palindrome (3102244422013).

Subtracting 1101122211002 from its reverse (2001122211011), we obtain a palindrome (900000000009).

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

Divisors: 1 2 11 22 121 242 4550091781 9100183562 50051009591 100102019182 550561105501 1101122211002