Search a number
-
+
1100322220101 = 31367421095377
BaseRepresentation
bin10000000000110000010…
…100001010100001000101
310220012010100101020121120
4100000300110022201011
5121011424442020401
62201251523504153
7142332003360516
oct20006024124105
93805110336546
101100322220101
1139470a2317a5
121592bb828059
137c9b5785b60
143b3821c2a0d
151d94dded836
hex1003050a845

1100322220101 has 16 divisors (see below), whose sum is σ = 1603531199424. Its totient is φ = 667015075584.

The previous prime is 1100322220087. The next prime is 1100322220141. The reversal of 1100322220101 is 1010222230011.

It is not a de Polignac number, because 1100322220101 - 213 = 1100322211909 is a prime.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 210545076 + ... + 210550301.

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

Almost surely, 21100322220101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 421095460.

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

Adding to 1100322220101 its reverse (1010222230011), we get a palindrome (2110544450112).

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

Divisors: 1 3 13 39 67 201 871 2613 421095377 1263286131 5474239901 16422719703 28213390259 84640170777 366774073367 1100322220101