Search a number
-
+
1020001111011 = 32173365397263
BaseRepresentation
bin11101101011111001100…
…11011100101111100011
310121111210122001010202100
432311330303130233203
5113202430241023021
62100325415421443
7133456402251021
oct16657463345743
93544718033670
101020001111011
11363642043703
12145824384883
1375254c7207c
143752293b711
151b7ec651626
hexed7ccdcbe3

1020001111011 has 12 divisors (see below), whose sum is σ = 1474185125088. Its totient is φ = 679608346704.

The previous prime is 1020001110917. The next prime is 1020001111027. The reversal of 1020001111011 is 1101111000201.

It is not a de Polignac number, because 1020001111011 - 27 = 1020001110883 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

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

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 32683035 + ... + 32714228.

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

Almost surely, 21020001111011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 65399002 (or 65398999 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 1020001111011 its reverse (1101111000201), we get a palindrome (2121112111212).

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

Divisors: 1 3 9 1733 5199 15597 65397263 196191789 588575367 113333456779 340000370337 1020001111011