Search a number
-
+
159911212397 is a prime number
BaseRepresentation
bin1001010011101101110…
…0110111010101101101
3120021202111011021022012
42110323130313111231
510104444232244042
6201243500131005
714360514610136
oct2247334672555
9507674137265
10159911212397
11618aa78a782
1226ba9b36a65
1312105a50791
147a4dc00c8d
15425dc9ee82
hex253b73756d

159911212397 has 2 divisors, whose sum is σ = 159911212398. Its totient is φ = 159911212396.

The previous prime is 159911212367. The next prime is 159911212441. The reversal of 159911212397 is 793212119951.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 159908812996 + 2399401 = 399886^2 + 1549^2 .

It is an emirp because it is prime and its reverse (793212119951) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 159911212397 - 210 = 159911211373 is a prime.

It is a congruent number.

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

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

Almost surely, 2159911212397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 306180, while the sum is 50.

The spelling of 159911212397 in words is "one hundred fifty-nine billion, nine hundred eleven million, two hundred twelve thousand, three hundred ninety-seven".