Search a number
-
+
1020110211111 = 32625112953287
BaseRepresentation
bin11101101100000110100…
…11101000100000100111
310121112002020022222221210
432312003103220200213
5113203141203223421
62100344314042503
7133462165504065
oct16660323504047
93545066288853
101020110211111
11363698690182
12145854a19433
1375271750944
143753321b035
151b807002576
hexed834e8827

1020110211111 has 8 divisors (see below), whose sum is σ = 1360198866304. Its totient is φ = 680047515000.

The previous prime is 1020110211101. The next prime is 1020110211167. The reversal of 1020110211111 is 1111120110201.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 1020110211111 - 29 = 1020110210599 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 21020110211111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 12979541.

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

Adding to 1020110211111 its reverse (1111120110201), we get a palindrome (2131230321312).

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

Divisors: 1 3 26251 78753 12953287 38859861 340036737037 1020110211111