Search a number
-
+
10411034321 is a prime number
BaseRepresentation
bin10011011001000101…
…11100011011010001
3222212120012100012202
421230202330123101
5132310211044241
64441024332545
7515665221512
oct115442743321
928776170182
1010411034321
1144628371a6
122026774155
13c9bbc334c
1470a99aa09
1540e000d9b
hex26c8bc6d1

10411034321 has 2 divisors, whose sum is σ = 10411034322. Its totient is φ = 10411034320.

The previous prime is 10411034269. The next prime is 10411034351. The reversal of 10411034321 is 12343011401.

10411034321 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., 7762491025 + 2648543296 = 88105^2 + 51464^2 .

It is a cyclic number.

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

It is a junction number, because it is equal to n+sod(n) for n = 10411034293 and 10411034302.

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

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

Almost surely, 210411034321 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 288, while the sum is 20.

Adding to 10411034321 its reverse (12343011401), we get a palindrome (22754045722).

The spelling of 10411034321 in words is "ten billion, four hundred eleven million, thirty-four thousand, three hundred twenty-one".