Search a number
-
+
10150605161 is a prime number
BaseRepresentation
bin10010111010000010…
…11111000101101001
3222012102011011120022
421131001133011221
5131242023331121
64355122410225
7506353502024
oct113501370551
928172134508
1010150605161
11433982a994
121b73500975
13c59c6b958
146c41681bb
153e620baab
hex25d05f169

10150605161 has 2 divisors, whose sum is σ = 10150605162. Its totient is φ = 10150605160.

The previous prime is 10150605151. The next prime is 10150605173. The reversal of 10150605161 is 16150605101.

10150605161 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 can be written as a sum of positive squares in only one way, i.e., 5765516761 + 4385088400 = 75931^2 + 66220^2 .

It is a cyclic number.

It is not a de Polignac number, because 10150605161 - 26 = 10150605097 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10150605161.

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

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

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

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

Almost surely, 210150605161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 900, while the sum is 26.

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