Search a number
-
+
165110166131 is a prime number
BaseRepresentation
bin1001100111000101010…
…1010011001001110011
3120210011210220111002012
42121301111103021303
510201121200304011
6203503415513135
714633404153511
oct2316125231163
9523153814065
10165110166131
1164028425659
1227bbb0887ab
1312753b8b371
147dc44914b1
154465405a8b
hex2671553273

165110166131 has 2 divisors, whose sum is σ = 165110166132. Its totient is φ = 165110166130.

The previous prime is 165110166127. The next prime is 165110166139. The reversal of 165110166131 is 131661011561.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 165110166131 - 22 = 165110166127 is a prime.

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

It is a Sophie Germain prime.

It is not a weakly prime, because it can be changed into another prime (165110166139) 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 as a sum of consecutive naturals, namely, 82555083065 + 82555083066.

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

Almost surely, 2165110166131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 32.

Adding to 165110166131 its reverse (131661011561), we get a palindrome (296771177692).

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