Search a number
-
+
11331064892369 is a prime number
BaseRepresentation
bin1010010011100011100000…
…0110010000101111010001
31111010020110101122202010202
42210320320012100233101
52441122010103023434
640033230325104545
72246433231300215
oct244707006205721
944106411582122
1011331064892369
113679528805682
121330052858155
13642690125981
142b25d8322945
15149b311e0a7e
hexa4e38190bd1

11331064892369 has 2 divisors, whose sum is σ = 11331064892370. Its totient is φ = 11331064892368.

The previous prime is 11331064892321. The next prime is 11331064892393. The reversal of 11331064892369 is 96329846013311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9230130600769 + 2100934291600 = 3038113^2 + 1449460^2 .

It is a cyclic number.

It is not a de Polignac number, because 11331064892369 - 220 = 11331063843793 is a prime.

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

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

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

Almost surely, 211331064892369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5038848, while the sum is 56.

The spelling of 11331064892369 in words is "eleven trillion, three hundred thirty-one billion, sixty-four million, eight hundred ninety-two thousand, three hundred sixty-nine".