Search a number
-
+
13206239773 is a prime number
BaseRepresentation
bin11000100110010011…
…10011101000011101
31021002100212111020121
430103021303220131
5204021244133043
610022235314541
7645156120526
oct142311635035
937070774217
1013206239773
11566763a451
1226868aba51
13132603217c
148d3cd384d
155245deded
hex313273a1d

13206239773 has 2 divisors, whose sum is σ = 13206239774. Its totient is φ = 13206239772.

The previous prime is 13206239719. The next prime is 13206239857. The reversal of 13206239773 is 37793260231.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11415426649 + 1790813124 = 106843^2 + 42318^2 .

It is an emirp because it is prime and its reverse (37793260231) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 13206239773 - 29 = 13206239261 is a prime.

It is a congruent number.

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

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

Almost surely, 213206239773 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 285768, while the sum is 43.

The spelling of 13206239773 in words is "thirteen billion, two hundred six million, two hundred thirty-nine thousand, seven hundred seventy-three".