Search a number
-
+
150112131 = 3133849029
BaseRepresentation
bin10001111001010…
…00011110000011
3101110110111010120
420330220132003
5301412042011
622521231323
73501634461
oct1074503603
9343414116
10150112131
1177809514
1242332543
132513ac60
1415d17831
15d2a2a06
hex8f28783

150112131 has 8 divisors (see below), whose sum is σ = 215545680. Its totient is φ = 92376672.

The previous prime is 150112073. The next prime is 150112147. The reversal of 150112131 is 131211051.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 150112131 - 27 = 150112003 is a prime.

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

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

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

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

Almost surely, 2150112131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3849045.

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 150112131 is about 12252.0255876324. The cubic root of 150112131 is about 531.4616482455.

Adding to 150112131 its reverse (131211051), we get a palindrome (281323182).

The spelling of 150112131 in words is "one hundred fifty million, one hundred twelve thousand, one hundred thirty-one".

Divisors: 1 3 13 39 3849029 11547087 50037377 150112131