Search a number
-
+
150530115 = 3511099049
BaseRepresentation
bin10001111100011…
…10100001000011
3101111020201111110
420332032201003
5302013430430
622534214403
73505325211
oct1076164103
9344221443
10150530115
1177a7455a
12424b4403
1325256298
1415dc5cb1
15d3367b0
hex8f8e843

150530115 has 16 divisors (see below), whose sum is σ = 241092000. Its totient is φ = 80201472.

The previous prime is 150530111. The next prime is 150530131. The reversal of 150530115 is 511035051.

It is not a de Polignac number, because 150530115 - 22 = 150530111 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 150530091 and 150530100.

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

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

Almost surely, 2150530115 is an apocalyptic number.

150530115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

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

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

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

The sum of its prime factors is 10166.

The product of its (nonzero) digits is 375, while the sum is 21.

The square root of 150530115 is about 12269.0714807601. The cubic root of 150530115 is about 531.9544722850.

Adding to 150530115 its reverse (511035051), we get a palindrome (661565166).

The spelling of 150530115 in words is "one hundred fifty million, five hundred thirty thousand, one hundred fifteen".

Divisors: 1 3 5 15 1109 3327 5545 9049 16635 27147 45245 135735 10035341 30106023 50176705 150530115