Search a number
-
+
981640111141 is a prime number
BaseRepresentation
bin11100100100011100100…
…11110110010000100101
310110211210012001102202101
432102032103312100211
5112040344332024031
62030543110212101
7130630646162164
oct16221623662045
93424705042671
10981640111141
11349347284728
1213a2b9354031
137175062bc91
1435723cd73db
151a8049be361
hexe48e4f6425

981640111141 has 2 divisors, whose sum is σ = 981640111142. Its totient is φ = 981640111140.

The previous prime is 981640111129. The next prime is 981640111183. The reversal of 981640111141 is 141111046189.

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., 591322550625 + 390317560516 = 768975^2 + 624754^2 .

It is a cyclic number.

It is not a de Polignac number, because 981640111141 - 225 = 981606556709 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2981640111141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6912, while the sum is 37.

The spelling of 981640111141 in words is "nine hundred eighty-one billion, six hundred forty million, one hundred eleven thousand, one hundred forty-one".