Search a number
-
+
10663592711 is a prime number
BaseRepresentation
bin10011110111001100…
…11000001100000111
31000112011102122012012
421323212120030013
5133314334431321
64522045444435
7525153020402
oct117346301407
930464378165
1010663592711
114582358042
12209727071b
13100c320395
14732340d39
1542628d05b
hex27b998307

10663592711 has 2 divisors, whose sum is σ = 10663592712. Its totient is φ = 10663592710.

The previous prime is 10663592677. The next prime is 10663592713. The reversal of 10663592711 is 11729536601.

10663592711 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 is a cyclic number.

It is not a de Polignac number, because 10663592711 - 26 = 10663592647 is a prime.

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

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

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 210663592711 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 41.

The spelling of 10663592711 in words is "ten billion, six hundred sixty-three million, five hundred ninety-two thousand, seven hundred eleven".