Search a number
-
+
11331131333069 is a prime number
BaseRepresentation
bin1010010011100011110000…
…0011101101100111001101
31111010020122000200021122102
42210320330003231213031
52441122124110124234
640033241101124445
72246434666110662
oct244707403554715
944106560607572
1011331131333069
113679562265549
121330070b59725
136426a0b193b2
142b2603099a69
15149b36e66c7e
hexa4e3c0ed9cd

11331131333069 has 2 divisors, whose sum is σ = 11331131333070. Its totient is φ = 11331131333068.

The previous prime is 11331131332987. The next prime is 11331131333129. The reversal of 11331131333069 is 96033313113311.

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., 11195802996169 + 135328336900 = 3346013^2 + 367870^2 .

It is a cyclic number.

It is not a de Polignac number, because 11331131333069 - 28 = 11331131332813 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 211331131333069 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 39366, while the sum is 38.

The spelling of 11331131333069 in words is "eleven trillion, three hundred thirty-one billion, one hundred thirty-one million, three hundred thirty-three thousand, sixty-nine".