Search a number
-
+
1111014141 = 31727677873
BaseRepresentation
bin100001000111000…
…1011101011111101
32212102120100212220
41002032023223331
54233404423031
6302124515553
736350315166
oct10216135375
92772510786
101111014141
11520158406
122700abbb9
13149239023
14a77a876d
156780e596
hex4238bafd

1111014141 has 16 divisors (see below), whose sum is σ = 1569256704. Its totient is φ = 696766464.

The previous prime is 1111014137. The next prime is 1111014181. The reversal of 1111014141 is 1414101111.

It is not a de Polignac number, because 1111014141 - 22 = 1111014137 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1111014141.

It is a congruent number.

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

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

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

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

Almost surely, 21111014141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 10660.

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

The square root of 1111014141 is about 33331.8787499295. The cubic root of 1111014141 is about 1035.7140369066.

Adding to 1111014141 its reverse (1414101111), we get a palindrome (2525115252).

The spelling of 1111014141 in words is "one billion, one hundred eleven million, fourteen thousand, one hundred forty-one".

Divisors: 1 3 17 51 2767 7873 8301 23619 47039 133841 141117 401523 21784591 65353773 370338047 1111014141