Search a number
-
+
150110110111 = 1337661947149
BaseRepresentation
bin1000101111001101000…
…0101000000110011111
3112100110102122200112211
42023303100220012133
54424411142010421
6152543140341251
713562603611663
oct2136320500637
9470412580484
10150110110111
1158730275545
12251136a4827
1311203322980
1473a02548a3
153d885ce9e1
hex22f342819f

150110110111 has 16 divisors (see below), whose sum is σ = 166054756000. Its totient is φ = 134795000448.

The previous prime is 150110110103. The next prime is 150110110181. The reversal of 150110110111 is 111011011051.

It is a cyclic number.

It is not a de Polignac number, because 150110110111 - 23 = 150110110103 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (13).

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3160165 + ... + 3207313.

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

Almost surely, 2150110110111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 53818.

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

Adding to 150110110111 its reverse (111011011051), we get a palindrome (261121121162).

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

Divisors: 1 13 37 481 6619 47149 86047 244903 612937 1744513 3183739 22678669 312079231 4057030003 11546931547 150110110111