Search a number
-
+
110141153 is a prime number
BaseRepresentation
bin1101001000010…
…01111011100001
321200020202020222
412210021323201
5211144004103
614532412425
72505120143
oct644117341
9250222228
10110141153
1157198751
1230a77115
1319a846a5
14108b0c93
159a09638
hex6909ee1

110141153 has 2 divisors, whose sum is σ = 110141154. Its totient is φ = 110141152.

The previous prime is 110141137. The next prime is 110141167. The reversal of 110141153 is 351141011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 66210769 + 43930384 = 8137^2 + 6628^2 .

It is a cyclic number.

It is not a de Polignac number, because 110141153 - 24 = 110141137 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2110141153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 60, while the sum is 17.

The square root of 110141153 is about 10494.8155295841. The cubic root of 110141153 is about 479.3468445563.

Adding to 110141153 its reverse (351141011), we get a palindrome (461282164).

It can be divided in two parts, 11014 and 1153, that added together give a cube (12167 = 233).

The spelling of 110141153 in words is "one hundred ten million, one hundred forty-one thousand, one hundred fifty-three".