Search a number
-
+
1101122210102 = 2550561105051
BaseRepresentation
bin10000000001011111111…
…111111000100100110110
310220021012002200221120212
4100001133333320210312
5121020044241210402
62201503142225422
7142360556233055
oct20013777704466
93807162627525
101101122210102
11394a8a866062
121594a3725272
137cab2434315
143b41a54839c
151d999272952
hex1005fff8936

1101122210102 has 4 divisors (see below), whose sum is σ = 1651683315156. Its totient is φ = 550561105050.

The previous prime is 1101122210057. The next prime is 1101122210161. The reversal of 1101122210102 is 2010122211011.

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

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

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275280552524 + ... + 275280552527.

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

Almost surely, 21101122210102 is an apocalyptic number.

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

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

1101122210102 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 550561105053.

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

Adding to 1101122210102 its reverse (2010122211011), we get a palindrome (3111244421113).

Subtracting 1101122210102 from its reverse (2010122211011), we obtain a palindrome (909000000909).

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

Divisors: 1 2 550561105051 1101122210102