Search a number
-
+
150500001 = 3208124107
BaseRepresentation
bin10001111100001…
…11001010100001
3101111012012012010
420332013022201
5302012000001
622533423133
73505141341
oct1076071241
9344165163
10150500001
1177a53973
124249aaa9
1325245672
1415db8d21
15d32c8d6
hex8f872a1

150500001 has 8 divisors (see below), whose sum is σ = 200771424. Its totient is φ = 100280960.

The previous prime is 150499981. The next prime is 150500027. The reversal of 150500001 is 100005051.

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 150500001 - 27 = 150499873 is a prime.

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

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

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

Almost surely, 2150500001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 26191.

The product of its (nonzero) digits is 25, while the sum is 12.

The square root of 150500001 is about 12267.8441871423. The cubic root of 150500001 is about 531.9189968912.

Adding to 150500001 its reverse (100005051), we get a palindrome (250505052).

The spelling of 150500001 in words is "one hundred fifty million, five hundred thousand, one".

Divisors: 1 3 2081 6243 24107 72321 50166667 150500001