Search a number
-
+
9127664713 is a prime number
BaseRepresentation
bin10001000000000110…
…10001110001001001
3212120010022102002001
420200003101301021
5122143140232323
64105421311001
7442122604246
oct104003216111
925503272061
109127664713
113964368662
121928a05461
13b2605bb4b
146283685cd
153864e83ad
hex2200d1c49

9127664713 has 2 divisors, whose sum is σ = 9127664714. Its totient is φ = 9127664712.

The previous prime is 9127664677. The next prime is 9127664731. The reversal of 9127664713 is 3174667219.

Together with next prime (9127664731) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5495553424 + 3632111289 = 74132^2 + 60267^2 .

It is a cyclic number.

It is not a de Polignac number, because 9127664713 - 213 = 9127656521 is a prime.

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

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

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

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

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

Almost surely, 29127664713 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 381024, while the sum is 46.

The square root of 9127664713 is about 95538.8125999062. The cubic root of 9127664713 is about 2089.8729891605.

The spelling of 9127664713 in words is "nine billion, one hundred twenty-seven million, six hundred sixty-four thousand, seven hundred thirteen".