Search a number
-
+
11045642136953 is a prime number
BaseRepresentation
bin1010000010111100001110…
…0100110110110101111001
31110002221201210101110200012
42200233003210312311321
52421432433341340303
635254144204551305
72220010211016104
oct240570344666571
943087653343605
1011045642136953
113579481032a56
1212a4877252535
136217a4395198
142a287d1d973b
151424c868a5d8
hexa0bc3936d79

11045642136953 has 2 divisors, whose sum is σ = 11045642136954. Its totient is φ = 11045642136952.

The previous prime is 11045642136929. The next prime is 11045642136959. The reversal of 11045642136953 is 35963124654011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5683208066704 + 5362434070249 = 2383948^2 + 2315693^2 .

It is a cyclic number.

It is not a de Polignac number, because 11045642136953 - 216 = 11045642071417 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 211045642136953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2332800, while the sum is 50.

The spelling of 11045642136953 in words is "eleven trillion, forty-five billion, six hundred forty-two million, one hundred thirty-six thousand, nine hundred fifty-three".