Search a number
-
+
964329891991 is a prime number
BaseRepresentation
bin11100000100001101000…
…10100110100010010111
310102012002210211012011121
432002012202212202113
5111244421423020431
62015001304144411
7126445664560024
oct16020642464227
93365083735147
10964329891991
11341a740a1894
12136a88168107
136cc222a055b
1434960d4454b
151a13ee6a611
hexe0868a6897

964329891991 has 2 divisors, whose sum is σ = 964329891992. Its totient is φ = 964329891990.

The previous prime is 964329891989. The next prime is 964329892061. The reversal of 964329891991 is 199198923469.

It is a happy number.

It is an a-pointer prime, because the next prime (964329892061) can be obtained adding 964329891991 to its sum of digits (70).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 964329891991 - 21 = 964329891989 is a prime.

Together with 964329891989, it forms a pair of twin primes.

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

It is a congruent number.

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

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

Almost surely, 2964329891991 is an apocalyptic number.

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

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

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

The product of its digits is 68024448, while the sum is 70.

The spelling of 964329891991 in words is "nine hundred sixty-four billion, three hundred twenty-nine million, eight hundred ninety-one thousand, nine hundred ninety-one".