Search a number
-
+
150116915 = 5132309491
BaseRepresentation
bin10001111001010…
…01101000110011
3101110110201200202
420330221220303
5301412220130
622521305415
73501654434
oct1074515063
9343421622
10150116915
1177812073
124233526b
13251401a0
1415d1948b
15d2a4145
hex8f29a33

150116915 has 8 divisors (see below), whose sum is σ = 193997328. Its totient is φ = 110855520.

The previous prime is 150116903. The next prime is 150116947. The reversal of 150116915 is 519611051.

150116915 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a Duffinian number.

It is an unprimeable number.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1154681 + ... + 1154810.

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

Almost surely, 2150116915 is an apocalyptic number.

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

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

150116915 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 2309509.

The product of its (nonzero) digits is 1350, while the sum is 29.

The square root of 150116915 is about 12252.2208191005. The cubic root of 150116915 is about 531.4672939929.

Adding to 150116915 its reverse (519611051), we get a palindrome (669727966).

The spelling of 150116915 in words is "one hundred fifty million, one hundred sixteen thousand, nine hundred fifteen".

Divisors: 1 5 13 65 2309491 11547455 30023383 150116915