Search a number
-
+
102711159 = 341268039
BaseRepresentation
bin1100001111100…
…11111101110111
321011021021020000
412013303331313
5202243224114
614105242343
72355013305
oct607637567
9234237200
10102711159
1152a83461
122a4933b3
1318382845
14d8d9275
15903ce09
hex61f3f77

102711159 has 10 divisors (see below), whose sum is σ = 153432840. Its totient is φ = 68474052.

The previous prime is 102711157. The next prime is 102711163. The reversal of 102711159 is 951117201.

It is not a de Polignac number, because 102711159 - 21 = 102711157 is a prime.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 633939 + ... + 634100.

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

Almost surely, 2102711159 is an apocalyptic number.

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

102711159 is an equidigital number, since it uses as much as digits as its factorization.

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

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

The product of its (nonzero) digits is 630, while the sum is 27.

The square root of 102711159 is about 10134.6514000236. The cubic root of 102711159 is about 468.3162310454.

The spelling of 102711159 in words is "one hundred two million, seven hundred eleven thousand, one hundred fifty-nine".

Divisors: 1 3 9 27 81 1268039 3804117 11412351 34237053 102711159