Search a number
-
+
1110221211022 = 271136493197551
BaseRepresentation
bin10000001001111110010…
…101110100010110001110
310221010200020002002022221
4100021332111310112032
5121142213112223042
62210010101325554
7143132213405410
oct20117625642616
93833606062287
101110221211022
11398929a26130
1215b202a068ba
1380902568431
143ba40b709b0
151dd2cea7d67
hex1027e57458e

1110221211022 has 32 divisors (see below), whose sum is σ = 2076325254144. Its totient is φ = 432539676000.

The previous prime is 1110221211017. The next prime is 1110221211031. The reversal of 1110221211022 is 2201121220111.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21110221211022 is an apocalyptic number.

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

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

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

The sum of its prime factors is 234064.

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

Adding to 1110221211022 its reverse (2201121220111), we get a palindrome (3311342431133).

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

Divisors: 1 2 7 11 14 22 77 154 36493 72986 197551 255451 395102 401423 510902 802846 1382857 2173061 2765714 2809961 4346122 5619922 15211427 30422854 7209228643 14418457286 50464600501 79301515073 100929201002 158603030146 555110605511 1110221211022