Search a number
-
+
1391962293437 is a prime number
BaseRepresentation
bin10100010000010111011…
…010110000010010111101
311221001220020121222220012
4110100113122300102331
5140301214321342222
62543243022433005
7202365060163142
oct24202732602275
94831806558805
101391962293437
114973674763a1
121a5931432765
13a13526210a1
144b52ad283c9
152631c6b71e2
hex144176b04bd

1391962293437 has 2 divisors, whose sum is σ = 1391962293438. Its totient is φ = 1391962293436.

The previous prime is 1391962293409. The next prime is 1391962293439. The reversal of 1391962293437 is 7343922691931.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1373785591396 + 18176702041 = 1172086^2 + 134821^2 .

It is a cyclic number.

It is not a de Polignac number, because 1391962293437 - 238 = 1117084386493 is a prime.

Together with 1391962293439, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

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

Almost surely, 21391962293437 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 13226976, while the sum is 59.

The spelling of 1391962293437 in words is "one trillion, three hundred ninety-one billion, nine hundred sixty-two million, two hundred ninety-three thousand, four hundred thirty-seven".