Search a number
-
+
150010161 = 377143341
BaseRepresentation
bin10001111000011…
…11100100110001
3101110021022020220
420330033210301
5301400311121
622515123253
73501031260
oct1074174461
9343238226
10150010161
1177749944
12422a3529
1325103712
1415ccc5d7
15d2826c6
hex8f0f931

150010161 has 8 divisors (see below), whose sum is σ = 228586944. Its totient is φ = 85720080.

The previous prime is 150010151. The next prime is 150010169. The reversal of 150010161 is 161010051.

150010161 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 not a de Polignac number, because 150010161 - 26 = 150010097 is a prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2150010161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7143351.

The product of its (nonzero) digits is 30, while the sum is 15.

The square root of 150010161 is about 12247.8635279791. The cubic root of 150010161 is about 531.3412817357.

The spelling of 150010161 in words is "one hundred fifty million, ten thousand, one hundred sixty-one".

Divisors: 1 3 7 21 7143341 21430023 50003387 150010161