Search a number
-
+
110299381 is a prime number
BaseRepresentation
bin1101001001100…
…00100011110101
321200112210022021
412210300203311
5211214040011
614540033141
72506346353
oct644604365
9250483267
10110299381
1157296615
1230b327b1
1319b0b70a
14109127d3
159a3b471
hex69308f5

110299381 has 2 divisors, whose sum is σ = 110299382. Its totient is φ = 110299380.

The previous prime is 110299369. The next prime is 110299433. The reversal of 110299381 is 183992011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 71673156 + 38626225 = 8466^2 + 6215^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×1102993812 = 24331906897966322, which contains 22 as substring.

It is equal to p6319456 and since 110299381 and 6319456 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110299361) 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, 55149690 + 55149691.

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

Almost surely, 2110299381 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3888, while the sum is 34.

The square root of 110299381 is about 10502.3512129427. The cubic root of 110299381 is about 479.5762768179.

The spelling of 110299381 in words is "one hundred ten million, two hundred ninety-nine thousand, three hundred eighty-one".