Search a number
-
+
110000000110153 is a prime number
BaseRepresentation
bin11001000000101101011110…
…111011101000111001001001
3112102110220020010202101012211
4121000231132323220321021
5103404220000012011103
61025541145154105121
732112144355455646
oct3100553673507111
9472426203671184
10110000000110153
113205a813405a2a
12104068a157b1a1
13494bc5630c63a
141d24057d6cdcd
15cab54473536d
hex640b5eee8e49

110000000110153 has 2 divisors, whose sum is σ = 110000000110154. Its totient is φ = 110000000110152.

The previous prime is 110000000110067. The next prime is 110000000110183. The reversal of 110000000110153 is 351011000000011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69275857996944 + 40724142113209 = 8323212^2 + 6381547^2 .

It is a cyclic number.

It is not a de Polignac number, because 110000000110153 - 221 = 109999998013001 is a prime.

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

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

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

Almost surely, 2110000000110153 is an apocalyptic number.

It is an amenable number.

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

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

110000000110153 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 13.

Adding to 110000000110153 its reverse (351011000000011), we get a palindrome (461011000110164).

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