Search a number
-
+
150751151 = 968915559
BaseRepresentation
bin10001111110001…
…00011110101111
3101111122221200222
420333010132233
5302043014101
622543041555
73510235505
oct1077043657
9344587628
10150751151
1178105631
12425a02bb
1325302a85
1416042675
15d37c01b
hex8fc47af

150751151 has 4 divisors (see below), whose sum is σ = 150776400. Its totient is φ = 150725904.

The previous prime is 150751147. The next prime is 150751169. The reversal of 150751151 is 151157051.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 150751151 - 22 = 150751147 is a prime.

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (150751141) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1910 + ... + 17468.

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

Almost surely, 2150751151 is an apocalyptic number.

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

150751151 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 25248.

The product of its (nonzero) digits is 875, while the sum is 26.

The square root of 150751151 is about 12278.0760300627. The cubic root of 150751151 is about 532.2147160779.

The spelling of 150751151 in words is "one hundred fifty million, seven hundred fifty-one thousand, one hundred fifty-one".

Divisors: 1 9689 15559 150751151