Search a number
-
+
411323210211311 is a prime number
BaseRepresentation
bin101110110000110001010010…
…1110101010001111111101111
31222221101010002201221201111022
41131201202211311101333233
5412403104413303230221
64014451135115044355
7152432056410445016
oct13541424565217757
91887333081851438
10411323210211311
1110a073214a99122
123a17123aa406bb
13148687c6280948
1473802146cda7d
1532846d997b4ab
hex17618a5d51fef

411323210211311 has 2 divisors, whose sum is σ = 411323210211312. Its totient is φ = 411323210211310.

The previous prime is 411323210211257. The next prime is 411323210211313. The reversal of 411323210211311 is 113112012323114.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 411323210211311 - 222 = 411323206017007 is a prime.

It is a Sophie Germain prime.

Together with 411323210211313, 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 (411323210211313) by changing a digit.

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

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

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

Almost surely, 2411323210211311 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 864, while the sum is 26.

Adding to 411323210211311 its reverse (113112012323114), we get a palindrome (524435222534425).

The spelling of 411323210211311 in words is "four hundred eleven trillion, three hundred twenty-three billion, two hundred ten million, two hundred eleven thousand, three hundred eleven".