Search a number
-
+
59140903397 is a prime number
BaseRepresentation
bin110111000101000100…
…101001000111100101
312122122122001011202112
4313011010221013211
51432110032402042
643100254450405
74162365245612
oct670504510745
9178578034675
1059140903397
1123099553074
12b566203a05
1357667855c4
142c10743509
151812105982
hexdc51291e5

59140903397 has 2 divisors, whose sum is σ = 59140903398. Its totient is φ = 59140903396.

The previous prime is 59140903363. The next prime is 59140903411. The reversal of 59140903397 is 79330904195.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52738663201 + 6402240196 = 229649^2 + 80014^2 .

It is a cyclic number.

It is not a de Polignac number, because 59140903397 - 26 = 59140903333 is a prime.

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

It is a congruent number.

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

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

Almost surely, 259140903397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 918540, while the sum is 50.

The spelling of 59140903397 in words is "fifty-nine billion, one hundred forty million, nine hundred three thousand, three hundred ninety-seven".