Search a number
-
+
13146693377 is a prime number
BaseRepresentation
bin11000011111001101…
…01001111100000001
31020221012211012221112
430033212221330001
5203411023142002
610012311133105
7643534023056
oct141746517401
936835735845
1013146693377
115636a69354
12266a974195
1313168b380c
148ca03302d
1551e27b852
hex30f9a9f01

13146693377 has 2 divisors, whose sum is σ = 13146693378. Its totient is φ = 13146693376.

The previous prime is 13146693359. The next prime is 13146693379. The reversal of 13146693377 is 77339664131.

13146693377 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 12160796176 + 985897201 = 110276^2 + 31399^2 .

It is a cyclic number.

It is not a de Polignac number, because 13146693377 - 214 = 13146676993 is a prime.

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

It is a Chen prime.

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

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

Almost surely, 213146693377 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 13146693377 in words is "thirteen billion, one hundred forty-six million, six hundred ninety-three thousand, three hundred seventy-seven".