Search a number
-
+
13980371677 is a prime number
BaseRepresentation
bin11010000010100101…
…11000101011011101
31100002022112110120121
431001102320223131
5212112433343202
610231131514541
71003306125046
oct150122705335
940068473517
1013980371677
115a24612188
122861bb8a51
13141a52899c
14968a478cd
1556c557537
hex3414b8add

13980371677 has 2 divisors, whose sum is σ = 13980371678. Its totient is φ = 13980371676.

The previous prime is 13980371663. The next prime is 13980371729. The reversal of 13980371677 is 77617308931.

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

It is an a-pointer prime, because the next prime (13980371729) can be obtained adding 13980371677 to its sum of digits (52).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 13975731961 + 4639716 = 118219^2 + 2154^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

Almost surely, 213980371677 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1333584, while the sum is 52.

The spelling of 13980371677 in words is "thirteen billion, nine hundred eighty million, three hundred seventy-one thousand, six hundred seventy-seven".