Search a number
-
+
141403255069 is a prime number
BaseRepresentation
bin1000001110110001001…
…0100111000100011101
3111111222122011121211011
42003230102213010131
54304043213130234
6144543150255221
713134050556646
oct2035422470435
9444878147734
10141403255069
1154a724a647a
12234a37b7511
131044651023b
146bb5b4a6cd
153a2900ab64
hex20ec4a711d

141403255069 has 2 divisors, whose sum is σ = 141403255070. Its totient is φ = 141403255068.

The previous prime is 141403255057. The next prime is 141403255109. The reversal of 141403255069 is 960552304141.

It is an a-pointer prime, because the next prime (141403255109) can be obtained adding 141403255069 to its sum of digits (40).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 140146907044 + 1256348025 = 374362^2 + 35445^2 .

It is a cyclic number.

It is not a de Polignac number, because 141403255069 - 213 = 141403246877 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2141403255069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 129600, while the sum is 40.

The spelling of 141403255069 in words is "one hundred forty-one billion, four hundred three million, two hundred fifty-five thousand, sixty-nine".