Search a number
BaseRepresentation
bin10010110100010000…
…00100101000101011
3222002000200210001111
421122020010220223
5131142103001141
64350224531151
7505223404354
oct113210045053
928060623044
1010102000171
11431435227a
121b5b180ab7
13c4cb814c3
146bb914d2b
153e1d0a381
hex25a204a2b

10102000171 has 2 divisors, whose sum is σ = 10102000172. Its totient is φ = 10102000170.

The previous prime is 10102000109. The next prime is 10102000189. The reversal of 10102000171 is 17100020101.

Adding to 10102000171 its reverse (17100020101), we get a palindrome (27202020272).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10102000171 - 27 = 10102000043 is a prime.

It is not a weakly prime, because it can be changed into another prime (10102000471) by changing a digit.

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

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5051000085 + 5051000086.

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

Almost surely, 210102000171 is an apocalyptic number.

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

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

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

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

The spelling of 10102000171 in words is "ten billion, one hundred two million, one hundred seventy-one", and thus it is an aban number.