Search a number
-
+
1011111071 = 29713111579
BaseRepresentation
bin111100010001000…
…101010010011111
32121110120202122012
4330101011102133
54032321023241
6244155341435
734025205455
oct7421052237
92543522565
101011111071
11479822793
1224275187b
1313162a699
14984009d5
155db786eb
hex3c44549f

1011111071 has 16 divisors (see below), whose sum is σ = 1064793600. Its totient is φ = 958792800.

The previous prime is 1011111053. The next prime is 1011111083. The reversal of 1011111071 is 1701111101.

1011111071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1011111071 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 (1011111571) by changing a digit.

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

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

Almost surely, 21011111071 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1990.

The product of its (nonzero) digits is 7, while the sum is 14.

The square root of 1011111071 is about 31797.9727498468. The cubic root of 1011111071 is about 1003.6900570636.

Adding to 1011111071 its reverse (1701111101), we get a palindrome (2712222172).

The spelling of 1011111071 in words is "one billion, eleven million, one hundred eleven thousand, seventy-one".

Divisors: 1 29 71 311 1579 2059 9019 22081 45791 112109 491069 640349 3251161 14241001 34865899 1011111071