Search a number
-
+
1102110120701 is a prime number
BaseRepresentation
bin10000000010011010111…
…000011101101011111101
310220100201221122000011022
4100002122320131223331
5121024110142330301
62202145152433525
7142424213312642
oct20023270355375
93810657560138
101102110120701
113954474819a7
1215971a5488a5
137cc0bcca8c5
143b4b1829dc9
151da05d66d1b
hex1009ae1dafd

1102110120701 has 2 divisors, whose sum is σ = 1102110120702. Its totient is φ = 1102110120700.

The previous prime is 1102110120611. The next prime is 1102110120721. The reversal of 1102110120701 is 1070210112011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 982677672601 + 119432448100 = 991301^2 + 345590^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 21102110120701 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 1102110120701 its reverse (1070210112011), we get a palindrome (2172320232712).

The spelling of 1102110120701 in words is "one trillion, one hundred two billion, one hundred ten million, one hundred twenty thousand, seven hundred one".