Search a number
-
+
690111001001593 is a prime number
BaseRepresentation
bin1001110011101001101111110…
…1000100011111111001111001
310100111110222010012221120120201
42130322123331010133321321
51210423234312224022333
610443424341150522201
7265234605641020423
oct23472337504377171
93314428105846521
10690111001001593
1118a9884829aa556
1265498175b06361
132380c25a4c2292
14c25b79d063813
1554bb58697017d
hex273a6fd11fe79

690111001001593 has 2 divisors, whose sum is σ = 690111001001594. Its totient is φ = 690111001001592.

The previous prime is 690111001001557. The next prime is 690111001001647. The reversal of 690111001001593 is 395100100111096.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 456830221246569 + 233280779755024 = 21373587^2 + 15273532^2 .

It is a cyclic number.

It is not a de Polignac number, because 690111001001593 - 245 = 654926628912761 is a prime.

It is not a weakly prime, because it can be changed into another prime (690111001001533) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (31) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 345055500500796 + 345055500500797.

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

Almost surely, 2690111001001593 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7290, while the sum is 37.

The spelling of 690111001001593 in words is "six hundred ninety trillion, one hundred eleven billion, one million, one thousand, five hundred ninety-three".