Search a number
-
+
1106054034013 is a prime number
BaseRepresentation
bin10000000110000101111…
…101010011001001011101
310220201220210210120010201
4100012011331103021131
5121110144313042023
62204040400303501
7142624023111325
oct20060575231135
93821823716121
101106054034013
11397090738395
1215a43b311b91
13803ba112616
143b767540285
151db8720dbad
hex10185f5325d

1106054034013 has 2 divisors, whose sum is σ = 1106054034014. Its totient is φ = 1106054034012.

The previous prime is 1106054033999. The next prime is 1106054034031. The reversal of 1106054034013 is 3104304506011.

Together with next prime (1106054034031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1102745713689 + 3308320324 = 1050117^2 + 57518^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1106054034013 is a prime.

It is a congruent number.

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

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

Almost surely, 21106054034013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4320, while the sum is 28.

The spelling of 1106054034013 in words is "one trillion, one hundred six billion, fifty-four million, thirty-four thousand, thirteen".