Search a number
-
+
591901497053 is a prime number
BaseRepresentation
bin10001001110100000001…
…01000001011011011101
32002120210122002110221122
420213100011001123131
534144203240401203
61131525451140325
760522604466156
oct10472005013335
92076718073848
10591901497053
11209029a67459
129686a7446a5
1343a7bba9129
142091089892d
15105e3db6538
hex89d01416dd

591901497053 has 2 divisors, whose sum is σ = 591901497054. Its totient is φ = 591901497052.

The previous prime is 591901496981. The next prime is 591901497059. The reversal of 591901497053 is 350794109195.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 590374016164 + 1527480889 = 768358^2 + 39083^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

Almost surely, 2591901497053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1530900, while the sum is 53.

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