Search a number
-
+
1000020111222 = 231115151819867
BaseRepresentation
bin11101000110101011101…
…01111110111101110110
310112121020010021011220010
432203111311332331312
5112341020122024342
62043223005321050
7132151300460226
oct16432565767566
93477203234803
101000020111222
11356119311840
12141988866186
13733bc4ba782
1436588da0086
151b02d3da29c
hexe8d5d7ef76

1000020111222 has 16 divisors (see below), whose sum is σ = 2181862060992. Its totient is φ = 303036397320.

The previous prime is 1000020111163. The next prime is 1000020111253. The reversal of 1000020111222 is 2221110200001.

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

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 21000020111222 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 15151819883.

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

Adding to 1000020111222 its reverse (2221110200001), we get a palindrome (3221130311223).

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

Divisors: 1 2 3 6 11 22 33 66 15151819867 30303639734 45455459601 90910919202 166670018537 333340037074 500010055611 1000020111222