Search a number
-
+
110485153 is a prime number
BaseRepresentation
bin1101001010111…
…01111010100001
321200220020010201
412211131322201
5211241011103
614544025201
72511052102
oct645357241
9250806121
10110485153
1157403149
1231002201
1319b7513c
14109603a9
159a7651d
hex695dea1

110485153 has 2 divisors, whose sum is σ = 110485154. Its totient is φ = 110485152.

The previous prime is 110485093. The next prime is 110485163. The reversal of 110485153 is 351584011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 91718929 + 18766224 = 9577^2 + 4332^2 .

It is a cyclic number.

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

It is equal to p6329431 and since 110485153 and 6329431 have the same sum of digits, it is a Honaker prime.

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

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

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

Almost surely, 2110485153 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2400, while the sum is 28.

The square root of 110485153 is about 10511.1917973178. The cubic root of 110485153 is about 479.8453683043.

It can be divided in two parts, 110485 and 153, that multiplied together give a triangular number (16904205 = T5814).

The spelling of 110485153 in words is "one hundred ten million, four hundred eighty-five thousand, one hundred fifty-three".