Search a number
-
+
1391105057 is a prime number
BaseRepresentation
bin101001011101010…
…1001010000100001
310120221121110101112
41102322221100201
510322110330212
6350012113105
746321124606
oct12272512041
93527543345
101391105057
11654273901
12329a65795
13192285bb4
14d2a786ad
15821d9422
hex52ea9421

1391105057 has 2 divisors, whose sum is σ = 1391105058. Its totient is φ = 1391105056.

The previous prime is 1391105029. The next prime is 1391105069. The reversal of 1391105057 is 7505011931.

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., 1169571601 + 221533456 = 34199^2 + 14884^2 .

It is a cyclic number.

It is not a de Polignac number, because 1391105057 - 26 = 1391104993 is a prime.

It is a super-2 number, since 2×13911050572 = 3870346559221946498, which contains 22 as substring.

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

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

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

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

Almost surely, 21391105057 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4725, while the sum is 32.

The square root of 1391105057 is about 37297.5207889211. The cubic root of 1391105057 is about 1116.3146984984.

Adding to 1391105057 its reverse (7505011931), we get a palindrome (8896116988).

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