Search a number
-
+
11434311029 is a prime number
BaseRepresentation
bin10101010011000100…
…11011110101110101
31002111212200011222002
422221202123311311
5141404140423104
65130340545045
7553232016521
oct125142336565
932455604862
1011434311029
114938409129
1222713b2185
131102bc021b
147a6846d81
1546dc7e01e
hex2a989bd75

11434311029 has 2 divisors, whose sum is σ = 11434311030. Its totient is φ = 11434311028.

The previous prime is 11434311013. The next prime is 11434311041. The reversal of 11434311029 is 92011343411.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 7396344004 + 4037967025 = 86002^2 + 63545^2 .

It is a cyclic number.

It is not a de Polignac number, because 11434311029 - 24 = 11434311013 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

Almost surely, 211434311029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 29.

The spelling of 11434311029 in words is "eleven billion, four hundred thirty-four million, three hundred eleven thousand, twenty-nine".