Search a number
-
+
110000561101 is a prime number
BaseRepresentation
bin110011001110010001…
…0110101101111001101
3101111221010110111001121
41212130202311233031
53300240120423401
6122311125440541
710642626225214
oct1463442655715
9344833414047
10110000561101
11427184a3732
121939ab70151
13a4b0665412
1454772cc07b
152cdc1a8ca1
hex199c8b5bcd

110000561101 has 2 divisors, whose sum is σ = 110000561102. Its totient is φ = 110000561100.

The previous prime is 110000561081. The next prime is 110000561117. The reversal of 110000561101 is 101165000011.

It is an a-pointer prime, because the next prime (110000561117) can be obtained adding 110000561101 to its sum of digits (16).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67410333225 + 42590227876 = 259635^2 + 206374^2 .

It is a cyclic number.

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

It is a congruent number.

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

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

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

Almost surely, 2110000561101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 30, while the sum is 16.

Adding to 110000561101 its reverse (101165000011), we get a palindrome (211165561112).

The spelling of 110000561101 in words is "one hundred ten billion, five hundred sixty-one thousand, one hundred one".