159968309141 has 4 divisors (see below), whose sum is σ = 160096387500. Its totient is φ = 159840230784.

The previous prime is 159968309131. The next prime is 159968309183. The reversal of 159968309141 is 141903869951.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 73970400625 + 85997908516 = 271975^2 + 293254^2 .

It is a cyclic number.

It is not a de Polignac number, because 159968309141 - 2³⁰ = 158894567317 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (159968309131) 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 in 3 ways as a sum of consecutive naturals, for example, 64037306 + ... + 64039803.

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

Almost surely, 2^159968309141 is an apocalyptic number.

It is an amenable number.

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

159968309141 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 128078358.

The product of its (nonzero) digits is 2099520, while the sum is 56.

The spelling of 159968309141 in words is "one hundred fifty-nine billion, nine hundred sixty-eight million, three hundred nine thousand, one hundred forty-one".