Search a number
-
+
150925709 = 1113720519
BaseRepresentation
bin10001111111011…
…11000110001101
3101111222211011002
420333233012031
5302114110314
622550510045
73511563434
oct1077570615
9344884132
10150925709
11782147a0
1242665325
132536436c
141608a11b
15d3b3ade
hex8fef18d

150925709 has 4 divisors (see below), whose sum is σ = 164646240. Its totient is φ = 137205180.

The previous prime is 150925703. The next prime is 150925727. The reversal of 150925709 is 907529051.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 150925709 - 24 = 150925693 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (150925703) by changing a digit.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6860249 + ... + 6860270.

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

Almost surely, 2150925709 is an apocalyptic number.

It is an amenable number.

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

150925709 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 13720530.

The product of its (nonzero) digits is 28350, while the sum is 38.

The square root of 150925709 is about 12285.1824976270. The cubic root of 150925709 is about 532.4200577972.

The spelling of 150925709 in words is "one hundred fifty million, nine hundred twenty-five thousand, seven hundred nine".

Divisors: 1 11 13720519 150925709