Search a number
-
+
1105505100061 is a prime number
BaseRepresentation
bin10000000101100101001…
…111010010000100011101
310220200111112212211022121
4100011211033102010131
5121103033301200221
62203510110542541
7142604306206645
oct20054517220435
93820445784277
101105505100061
1139692989916a
1215a307507a51
138033048642b
143b71468b525
151db53e2ba41
hex101653d211d

1105505100061 has 2 divisors, whose sum is σ = 1105505100062. Its totient is φ = 1105505100060.

The previous prime is 1105505100053. The next prime is 1105505100083. The reversal of 1105505100061 is 1600015055011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 826199192025 + 279305908036 = 908955^2 + 528494^2 .

It is a cyclic number.

It is not a de Polignac number, because 1105505100061 - 23 = 1105505100053 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1105505099999 and 1105505100035.

It is a congruent number.

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

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

Almost surely, 21105505100061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 25.

The spelling of 1105505100061 in words is "one trillion, one hundred five billion, five hundred five million, one hundred thousand, sixty-one".