Search a number
-
+
151109909 is a prime number
BaseRepresentation
bin10010000000111…
…00000100010101
3101112100011211022
421000130010111
5302141004114
622554450525
73513261446
oct1100340425
9345304738
10151109909
1178330125
1242733a45
13253ca162
14160d72cd
15d3ed48e
hex901c115

151109909 has 2 divisors, whose sum is σ = 151109910. Its totient is φ = 151109908.

The previous prime is 151109891. The next prime is 151109911. The reversal of 151109909 is 909901151.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 122988100 + 28121809 = 11090^2 + 5303^2 .

It is a cyclic number.

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

Together with 151109911, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2151109909 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3645, while the sum is 35.

The square root of 151109909 is about 12292.6770477386. The cubic root of 151109909 is about 532.6365702887.

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