Search a number
-
+
12701535997 is a prime number
BaseRepresentation
bin10111101010001001…
…00000111011111101
31012210012011212211011
423311010200323331
5202003043122442
65500205555221
7626520163123
oct136504407375
935705155734
1012701535997
11542875aa97
122565875b11
1312755c1097
14886c75913
154e5148117
hex2f5120efd

12701535997 has 2 divisors, whose sum is σ = 12701535998. Its totient is φ = 12701535996.

The previous prime is 12701535947. The next prime is 12701536007. The reversal of 12701535997 is 79953510721.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 11076720516 + 1624815481 = 105246^2 + 40309^2 .

It is a cyclic number.

It is not a de Polignac number, because 12701535997 - 231 = 10554052349 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 12701535997.

It is a congruent number.

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

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

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

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

Almost surely, 212701535997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 595350, while the sum is 49.

The spelling of 12701535997 in words is "twelve billion, seven hundred one million, five hundred thirty-five thousand, nine hundred ninety-seven".