Search a number
-
+
139568635957 is a prime number
BaseRepresentation
bin1000000111111011110…
…0000110000000110101
3111100020210000022112011
42001332330012000311
54241314032322312
6144041132124221
713040432555122
oct2017674060065
9440223008464
10139568635957
1154210946a33
1223071306671
13102133bb8ba
146a80221749
15396ce14da7
hex207ef06035

139568635957 has 2 divisors, whose sum is σ = 139568635958. Its totient is φ = 139568635956.

The previous prime is 139568635889. The next prime is 139568635961. The reversal of 139568635957 is 759536865931.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 138022652196 + 1545983761 = 371514^2 + 39319^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-139568635957 is a prime.

It is a super-5 number, since 5×1395686359575 (a number of 57 digits) contains 55555 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 139568635892 and 139568635901.

It is a congruent number.

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

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

Almost surely, 2139568635957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 183708000, while the sum is 67.

The spelling of 139568635957 in words is "one hundred thirty-nine billion, five hundred sixty-eight million, six hundred thirty-five thousand, nine hundred fifty-seven".