Search a number
-
+
140405069131 is a prime number
BaseRepresentation
bin1000001011000011001…
…0110101010101001011
3111102102001220112010121
42002300302311111023
54300022144203011
6144300131524111
713100240252605
oct2026062652513
9442361815117
10140405069131
1154600001618
1223265459637
1310317789982
146b1d352175
1539bb586e71
hex20b0cb554b

140405069131 has 2 divisors, whose sum is σ = 140405069132. Its totient is φ = 140405069130.

The previous prime is 140405069117. The next prime is 140405069141. The reversal of 140405069131 is 131960504041.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 140405069131 - 27 = 140405069003 is a prime.

It is a super-2 number, since 2×1404050691312 (a number of 23 digits) contains 22 as substring.

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

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

Almost surely, 2140405069131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 34.

The spelling of 140405069131 in words is "one hundred forty billion, four hundred five million, sixty-nine thousand, one hundred thirty-one".