Search a number
-
+
102011141 = 2313133857
BaseRepresentation
bin1100001010010…
…01000100000101
321002221200222102
412011021010011
5202103324031
614042241445
72346036401
oct605110405
9232850872
10102011141
1152645531
122a1b6285
131819902b
14d796101
158e507cb
hex6149105

102011141 has 8 divisors (see below), whose sum is σ = 107262144. Its totient is φ = 96828160.

The previous prime is 102011113. The next prime is 102011191. The reversal of 102011141 is 141110201.

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

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

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

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

Almost surely, 2102011141 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 34011.

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

The square root of 102011141 is about 10100.0564849906. The cubic root of 102011141 is about 467.2498834627.

Adding to 102011141 its reverse (141110201), we get a palindrome (243121342).

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

Divisors: 1 23 131 3013 33857 778711 4435267 102011141