Search a number
-
+
11010154026 = 2310118168571
BaseRepresentation
bin10100100000100000…
…11001111000101010
31001102022112202221110
422100100121320222
5140022044412101
65020305451150
7536561523264
oct122020317052
931368482843
1011010154026
11473aa43753
122173340ab6
131066071351
14766394b34
154468e7cd6
hex290419e2a

11010154026 has 16 divisors (see below), whose sum is σ = 22238332128. Its totient is φ = 3633714000.

The previous prime is 11010154021. The next prime is 11010154033. The reversal of 11010154026 is 62045101011.

It is a Curzon number.

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

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

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

Almost surely, 211010154026 is an apocalyptic number.

11010154026 is an abundant number, since it is smaller than the sum of its proper divisors (11228178102).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

The sum of its prime factors is 18168677.

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

Adding to 11010154026 its reverse (62045101011), we get a palindrome (73055255037).

The spelling of 11010154026 in words is "eleven billion, ten million, one hundred fifty-four thousand, twenty-six".

Divisors: 1 2 3 6 101 202 303 606 18168571 36337142 54505713 109011426 1835025671 3670051342 5505077013 11010154026