Search a number
-
+
1101122201022 = 231731060811369
BaseRepresentation
bin10000000001011111111…
…111110110010110111110
310220021012002200111010120
4100001133333312112332
5121020044240413042
62201503142115410
7142360556164434
oct20013777662676
93807162614116
101101122201022
11394a8a85a258
121594a371bb66
137cab243014c
143b41a544d54
151d99926edec
hex1005fff65be

1101122201022 has 16 divisors (see below), whose sum is σ = 2214974140560. Its totient is φ = 364919110592.

The previous prime is 1101122201017. The next prime is 1101122201029. The reversal of 1101122201022 is 2201022211011.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1101122201029) by changing a digit.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 530404647 + ... + 530406722.

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

Almost surely, 21101122201022 is an apocalyptic number.

1101122201022 is an abundant number, since it is smaller than the sum of its proper divisors (1113851939538).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 1060811547.

The product of its (nonzero) digits is 32, while the sum is 15.

Adding to 1101122201022 its reverse (2201022211011), we get a palindrome (3302144412033).

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

Divisors: 1 2 3 6 173 346 519 1038 1060811369 2121622738 3182434107 6364868214 183520366837 367040733674 550561100511 1101122201022