Search a number
-
+
150111641 = 3130715773
BaseRepresentation
bin10001111001010…
…00010110011001
3101110110110110102
420330220112121
5301412033031
622521225145
73501633161
oct1074502631
9343413412
10150111641
1177809109
12423321b5
132513a974
1415d175a1
15d2a27cb
hex8f28599

150111641 has 8 divisors (see below), whose sum is σ = 155468544. Its totient is φ = 144786960.

The previous prime is 150111631. The next prime is 150111653. The reversal of 150111641 is 146111051.

It is a happy number.

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

It is a cyclic number.

It is not a de Polignac number, because 150111641 - 210 = 150110617 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (150111601) 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, 1631 + ... + 17403.

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

Almost surely, 2150111641 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 16111.

The product of its (nonzero) digits is 120, while the sum is 20.

The square root of 150111641 is about 12252.0055909227. The cubic root of 150111641 is about 531.4610699745.

Adding to 150111641 its reverse (146111051), we get a palindrome (296222692).

The spelling of 150111641 in words is "one hundred fifty million, one hundred eleven thousand, six hundred forty-one".

Divisors: 1 31 307 9517 15773 488963 4842311 150111641