Search a number
-
+
10642712713 is a prime number
BaseRepresentation
bin10011110100101101…
…01110100010001001
31000110201010211012221
421322112232202021
5133244013301323
64520022134041
7524510364643
oct117226564211
930421124187
1010642712713
114571596646
122090281321
131007bbc559
1472d667893
1542451655d
hex27a5ae889

10642712713 has 2 divisors, whose sum is σ = 10642712714. Its totient is φ = 10642712712.

The previous prime is 10642712683. The next prime is 10642712737. The reversal of 10642712713 is 31721724601.

10642712713 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., 8868365584 + 1774347129 = 94172^2 + 42123^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 210642712713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 14112, while the sum is 34.

The spelling of 10642712713 in words is "ten billion, six hundred forty-two million, seven hundred twelve thousand, seven hundred thirteen".