Search a number
-
+
150015010161 = 3469191065773
BaseRepresentation
bin1000101110110110010…
…1110110010101110001
3112100012210201002221110
42023231211312111301
54424212320311121
6152525502143533
713560340355442
oct2135545662561
9470183632843
10150015010161
1158691620545
12250a7881ba9
13111b9706603
14739177b2c9
153d80096d76
hex22ed976571

150015010161 has 8 divisors (see below), whose sum is σ = 200024464320. Its totient is φ = 100007781392.

The previous prime is 150015010153. The next prime is 150015010177. The reversal of 150015010161 is 161010510051.

It is a happy number.

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 150015010161 - 23 = 150015010153 is a prime.

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

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

Almost surely, 2150015010161 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1112695.

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

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

Divisors: 1 3 46919 140757 1065773 3197319 50005003387 150015010161