Search a number
-
+
1101110110153 is a prime number
BaseRepresentation
bin10000000001011111010…
…001101110011111001001
310220021011020221012120121
4100001133101232133021
5121020033142011103
62201502031023241
7142360351336204
oct20013721563711
93807136835517
101101110110153
11394a83a511a9
1215949b66ab21
137caaca889a1
143b418ab893b
151d9981826bd
hex1005f46e7c9

1101110110153 has 2 divisors, whose sum is σ = 1101110110154. Its totient is φ = 1101110110152.

The previous prime is 1101110110073. The next prime is 1101110110181. The reversal of 1101110110153 is 3510110111011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 933393651129 + 167716459024 = 966123^2 + 409532^2 .

It is a cyclic number.

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

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

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

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

Almost surely, 21101110110153 is an apocalyptic number.

It is an amenable number.

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

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

1101110110153 is an evil number, because the sum of its binary digits is even.

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

Adding to 1101110110153 its reverse (3510110111011), we get a palindrome (4611220221164).

The spelling of 1101110110153 in words is "one trillion, one hundred one billion, one hundred ten million, one hundred ten thousand, one hundred fifty-three".