Search a number
-
+
160050236113 is a prime number
BaseRepresentation
bin1001010100001110111…
…1001100101011010001
3120022010011202101222201
42111003233030223101
510110240330023423
6201305344003201
714364123363115
oct2250357145321
9508104671881
10160050236113
1161971205309
1227028600501
13121287a8631
147a6446d745
15426b0b22ad
hex2543bccad1

160050236113 has 2 divisors, whose sum is σ = 160050236114. Its totient is φ = 160050236112.

The previous prime is 160050236011. The next prime is 160050236147. The reversal of 160050236113 is 311632050061.

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

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 86808015424 + 73242220689 = 294632^2 + 270633^2 .

It is a cyclic number.

It is not a de Polignac number, because 160050236113 - 213 = 160050227921 is a prime.

It is not a weakly prime, because it can be changed into another prime (160050236713) 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, 80025118056 + 80025118057.

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

Almost surely, 2160050236113 is an apocalyptic number.

It is an amenable number.

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

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

160050236113 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 28.

Adding to 160050236113 its reverse (311632050061), we get a palindrome (471682286174).

The spelling of 160050236113 in words is "one hundred sixty billion, fifty million, two hundred thirty-six thousand, one hundred thirteen".