Search a number
-
+
150671651 = 1311590127
BaseRepresentation
bin10001111101100…
…01000100100011
3101111111220122112
420332301010203
5302032443101
622541225535
73506454644
oct1076610443
9344456575
10150671651
1178060929
12425622ab
13252a5830
14160216cb
15d3636bb
hex8fb1123

150671651 has 4 divisors (see below), whose sum is σ = 162261792. Its totient is φ = 139081512.

The previous prime is 150671623. The next prime is 150671683. The reversal of 150671651 is 156176051.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 156176051 = 653239167.

It is a cyclic number.

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

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (150671611) 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 in 3 ways as a sum of consecutive naturals, for example, 5795051 + ... + 5795076.

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

Almost surely, 2150671651 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11590140.

The product of its (nonzero) digits is 6300, while the sum is 32.

The square root of 150671651 is about 12274.8381252056. The cubic root of 150671651 is about 532.1211435258.

The spelling of 150671651 in words is "one hundred fifty million, six hundred seventy-one thousand, six hundred fifty-one".

Divisors: 1 13 11590127 150671651