Search a number
-
+
1106050555037 is a prime number
BaseRepresentation
bin10000000110000101110…
…000000001110010011101
310220201220120020210212202
4100012011300001302131
5121110142420230122
62204040153541245
7142623651411461
oct20060560016235
93821816223782
101106050555037
113970897815aa
1215a43a114825
13803b9494c5c
143b766cb64a1
151db86c72e92
hex10185c01c9d

1106050555037 has 2 divisors, whose sum is σ = 1106050555038. Its totient is φ = 1106050555036.

The previous prime is 1106050555021. The next prime is 1106050555073. The reversal of 1106050555037 is 7305550506011.

Together with next prime (1106050555073) 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., 1098693890596 + 7356664441 = 1048186^2 + 85771^2 .

It is a cyclic number.

It is not a de Polignac number, because 1106050555037 - 24 = 1106050555021 is a prime.

It is a congruent number.

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

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

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

Almost surely, 21106050555037 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1106050555037 in words is "one trillion, one hundred six billion, fifty million, five hundred fifty-five thousand, thirty-seven".