Search a number
-
+
1110109936181 is a prime number
BaseRepresentation
bin10000001001110111101…
…101010101101000110101
310221010101110200201221112
4100021313231111220311
5121142001120424211
62205551044324405
7143126362524101
oct20116755255065
93833343621845
101110109936181
11398882133754
1215b1916a3705
13808b54a7a2c
143ba30086901
151dd2332788b
hex10277b55a35

1110109936181 has 2 divisors, whose sum is σ = 1110109936182. Its totient is φ = 1110109936180.

The previous prime is 1110109936163. The next prime is 1110109936183. The reversal of 1110109936181 is 1816399010111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1096188060100 + 13921876081 = 1046990^2 + 117991^2 .

It is a cyclic number.

It is not a de Polignac number, because 1110109936181 - 214 = 1110109919797 is a prime.

It is a super-2 number, since 2×11101099361812 (a number of 25 digits) contains 22 as substring.

Together with 1110109936183, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21110109936181 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 41.

The spelling of 1110109936181 in words is "one trillion, one hundred ten billion, one hundred nine million, nine hundred thirty-six thousand, one hundred eighty-one".