Search a number
-
+
109333151 is a prime number
BaseRepresentation
bin1101000010001…
…00101010011111
321121201200212222
412201010222133
5210442130101
614503215555
72465213354
oct641045237
9247650788
10109333151
1156796684
12307475bb
1319860995
141074062b
1598ea01b
hex6844a9f

109333151 has 2 divisors, whose sum is σ = 109333152. Its totient is φ = 109333150.

The previous prime is 109333141. The next prime is 109333177. The reversal of 109333151 is 151333901.

It is an a-pointer prime, because the next prime (109333177) can be obtained adding 109333151 to its sum of digits (26).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 109333151 - 210 = 109332127 is a prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 109333151.

It is a congruent number.

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

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

Almost surely, 2109333151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1215, while the sum is 26.

The square root of 109333151 is about 10456.2493753736. The cubic root of 109333151 is about 478.1717941926.

The spelling of 109333151 in words is "one hundred nine million, three hundred thirty-three thousand, one hundred fifty-one".