Search a number
-
+
10110000011701 is a prime number
BaseRepresentation
bin1001001100011110101011…
…1101011001100110110101
31022210111200021122211020211
42103013222331121212311
52311120240000333301
633300245255025421
72062265140124002
oct223075275314665
938714607584224
1010110000011701
1132486994919a7
12117347666b271
135844a465a845
1426d4803168a9
15127eb703e051
hex931eaf599b5

10110000011701 has 2 divisors, whose sum is σ = 10110000011702. Its totient is φ = 10110000011700.

The previous prime is 10110000011647. The next prime is 10110000011719. The reversal of 10110000011701 is 10711000001101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8109543371076 + 2000456640625 = 2847726^2 + 1414375^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 210110000011701 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 7, while the sum is 13.

Adding to 10110000011701 its reverse (10711000001101), we get a palindrome (20821000012802).

The spelling of 10110000011701 in words is "ten trillion, one hundred ten billion, eleven thousand, seven hundred one".