Search a number
-
+
1391119997 is a prime number
BaseRepresentation
bin101001011101010…
…1100111001111101
310120221122012212212
41102322230321331
510322111314442
6350012310205
746321216301
oct12272547175
93527565785
101391119997
11654284053
12329a72365
1319228c937
14d2a7dd01
15821dda82
hex52eace7d

1391119997 has 2 divisors, whose sum is σ = 1391119998. Its totient is φ = 1391119996.

The previous prime is 1391119993. The next prime is 1391119999. The reversal of 1391119997 is 7999111931.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 919969561 + 471150436 = 30331^2 + 21706^2 .

It is a cyclic number.

It is not a de Polignac number, because 1391119997 - 22 = 1391119993 is a prime.

Together with 1391119999, 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 (1391119993) 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, 695559998 + 695559999.

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

Almost surely, 21391119997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 137781, while the sum is 50.

The square root of 1391119997 is about 37297.7210697919. The cubic root of 1391119997 is about 1116.3186947655.

The spelling of 1391119997 in words is "one billion, three hundred ninety-one million, one hundred nineteen thousand, nine hundred ninety-seven".