Search a number
-
+
150100011011 = 293512286727
BaseRepresentation
bin1000101111001010101…
…0000110100000000011
3112100102201122121012002
42023302222012200003
54424401100323021
6152542140054215
713562422020356
oct2136252064003
9470381577162
10150100011011
11587255a7985
122511023436b
13112011c7c82
14739cb8629d
153d8778750b
hex22f2a86803

150100011011 has 4 divisors (see below), whose sum is σ = 150612298032. Its totient is φ = 149587723992.

The previous prime is 150100010999. The next prime is 150100011013. The reversal of 150100011011 is 110110001051.

It is a happy number.

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

It is a cyclic number.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 150100010983 and 150100011001.

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

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

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

Almost surely, 2150100011011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 512287020.

The product of its (nonzero) digits is 5, while the sum is 11.

Adding to 150100011011 its reverse (110110001051), we get a palindrome (260210012062).

The spelling of 150100011011 in words is "one hundred fifty billion, one hundred million, eleven thousand, eleven".

Divisors: 1 293 512286727 150100011011