Search a number
-
+
10111002141 = 316727174471
BaseRepresentation
bin10010110101010100…
…11010011000011101
3222002122122010102210
421122222122120131
5131201404032031
64351145511033
7505363046232
oct113252323035
928078563383
1010111002141
114319440619
121b621a2479
13c519b3a06
146bcbb9789
153e29d7746
hex25aa9a61d

10111002141 has 16 divisors (see below), whose sum is σ = 13612290048. Its totient is φ = 6675490800.

The previous prime is 10111002137. The next prime is 10111002179. The reversal of 10111002141 is 14120011101.

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

It is not a de Polignac number, because 10111002141 - 22 = 10111002137 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10111002131) 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, 98536 + ... + 173006.

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

Almost surely, 210111002141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 74912.

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

Adding to 10111002141 its reverse (14120011101), we get a palindrome (24231013242).

The spelling of 10111002141 in words is "ten billion, one hundred eleven million, two thousand, one hundred forty-one".

Divisors: 1 3 167 271 501 813 45257 74471 135771 223413 12436657 20181641 37309971 60544923 3370334047 10111002141