Search a number
-
+
1105436314553 is a prime number
BaseRepresentation
bin10000000101100001001…
…000111000101110111001
310220200022202110011100012
4100011201020320232321
5121102413144031203
62203455212351305
7142602512432054
oct20054110705671
93820282404305
101105436314553
113968a3a8763a
1215a2a8475535
138031c15164c
143b7094a3a9b
151db4cd90bd8
hex10161238bb9

1105436314553 has 2 divisors, whose sum is σ = 1105436314554. Its totient is φ = 1105436314552.

The previous prime is 1105436314517. The next prime is 1105436314561. The reversal of 1105436314553 is 3554136345011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1064140791184 + 41295523369 = 1031572^2 + 203213^2 .

It is a cyclic number.

It is not a de Polignac number, because 1105436314553 - 222 = 1105432120249 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1105436314553.

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

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

Almost surely, 21105436314553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324000, while the sum is 41.

The spelling of 1105436314553 in words is "one trillion, one hundred five billion, four hundred thirty-six million, three hundred fourteen thousand, five hundred fifty-three".