Search a number
-
+
151166015597 is a prime number
BaseRepresentation
bin1000110011001000110…
…0100101100001101101
3112110012000112020120102
42030302030211201231
54434041444444342
6153240020200445
713631014634432
oct2146214454155
9473160466512
10151166015597
1159122302a03
1225369239125
131134100520c
147460595b89
153deb155832
hex233232586d

151166015597 has 2 divisors, whose sum is σ = 151166015598. Its totient is φ = 151166015596.

The previous prime is 151166015531. The next prime is 151166015621. The reversal of 151166015597 is 795510661151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 147654979081 + 3511036516 = 384259^2 + 59254^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151166015597 is a prime.

It is a congruent number.

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

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

Almost surely, 2151166015597 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 283500, while the sum is 47.

The spelling of 151166015597 in words is "one hundred fifty-one billion, one hundred sixty-six million, fifteen thousand, five hundred ninety-seven".