Search a number
-
+
12970727669 is a prime number
BaseRepresentation
bin11000001010001110…
…11001100011110101
31020110221201020101002
430011013121203311
5203031001241134
65543023413045
7636266236364
oct140507314365
936427636332
1012970727669
115556701749
12261ba54185
1312b92c2cb3
148b09097db
1550dabd87e
hex3051d98f5

12970727669 has 2 divisors, whose sum is σ = 12970727670. Its totient is φ = 12970727668.

The previous prime is 12970727621. The next prime is 12970727681. The reversal of 12970727669 is 96672707921.

12970727669 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., 7549350769 + 5421376900 = 86887^2 + 73630^2 .

It is a cyclic number.

It is not a de Polignac number, because 12970727669 - 212 = 12970723573 is a prime.

It is a super-2 number, since 2×129707276692 (a number of 21 digits) contains 22 as substring.

It is a congruent number.

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

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

Almost surely, 212970727669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4000752, while the sum is 56.

The spelling of 12970727669 in words is "twelve billion, nine hundred seventy million, seven hundred twenty-seven thousand, six hundred sixty-nine".