Search a number
-
+
140216250061 is a prime number
BaseRepresentation
bin1000001010010110001…
…0100010111011001101
3111101220220121112001201
42002211202202323031
54244130330000221
6144225304505501
713062455313646
oct2024542427315
9441826545051
10140216250061
1154513465aa8
122321217b291
13102b7618904
146b022406cd
1539a9bda891
hex20a58a2ecd

140216250061 has 2 divisors, whose sum is σ = 140216250062. Its totient is φ = 140216250060.

The previous prime is 140216250029. The next prime is 140216250089. The reversal of 140216250061 is 160052612041.

It is an a-pointer prime, because the next prime (140216250089) can be obtained adding 140216250061 to its sum of digits (28).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 139748868900 + 467381161 = 373830^2 + 21619^2 .

It is a cyclic number.

It is not a de Polignac number, because 140216250061 - 25 = 140216250029 is a prime.

It is a congruent number.

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

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

Almost surely, 2140216250061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2880, while the sum is 28.

The spelling of 140216250061 in words is "one hundred forty billion, two hundred sixteen million, two hundred fifty thousand, sixty-one".