Search a number
-
+
106165511131 is a prime number
BaseRepresentation
bin110001011011111110…
…1010010001111011011
3101011000212010202111211
41202313331102033123
53214411332324011
6120434411203551
710445610645421
oct1426775221733
9334025122454
10106165511131
114102a732949
12186aa7465b7
13a01bc78594
1451d1c35111
152b65667b21
hex18b7f523db

106165511131 has 2 divisors, whose sum is σ = 106165511132. Its totient is φ = 106165511130.

The previous prime is 106165511083. The next prime is 106165511191. The reversal of 106165511131 is 131115561601.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 106165511131 - 225 = 106131956699 is a prime.

It is a super-2 number, since 2×1061655111312 (a number of 23 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 106165511093 and 106165511102.

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

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

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

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

Almost surely, 2106165511131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2700, while the sum is 31.

The spelling of 106165511131 in words is "one hundred six billion, one hundred sixty-five million, five hundred eleven thousand, one hundred thirty-one".