Search a number
-
+
105790596397 is a prime number
BaseRepresentation
bin110001010000110011…
…1000110010100101101
3101010001201200010011221
41202201213012110231
53213124343041042
6120333255343341
710433406142513
oct1424147062455
9333051603157
10105790596397
1140958040962
1218605081b51
139c8c3aac45
1451981204b3
152b427abd67
hex18a19c652d

105790596397 has 2 divisors, whose sum is σ = 105790596398. Its totient is φ = 105790596396.

The previous prime is 105790596293. The next prime is 105790596421. The reversal of 105790596397 is 793695097501.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 104387794281 + 1402802116 = 323091^2 + 37454^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1057905963972 (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 (105790596997) 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, 52895298198 + 52895298199.

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

Almost surely, 2105790596397 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 16074450, while the sum is 61.

The spelling of 105790596397 in words is "one hundred five billion, seven hundred ninety million, five hundred ninety-six thousand, three hundred ninety-seven".