Search a number
-
+
11001012111 = 332833143821
BaseRepresentation
bin10100011111011011…
…00001111110001111
31001101200100022121000
422033231201332033
5140012224341421
65015341511343
7536421026415
oct121755417617
931350308530
1011001012111
11473586a251
122170272553
1310641c022b
147650952b5
15445bde226
hex28fb61f8f

11001012111 has 16 divisors (see below), whose sum is σ = 16303661920. Its totient is φ = 7331368320.

The previous prime is 11001012109. The next prime is 11001012131. The reversal of 11001012111 is 11121010011.

It is not a de Polignac number, because 11001012111 - 21 = 11001012109 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 211001012111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 146663 (or 146657 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 11001012111 its reverse (11121010011), we get a palindrome (22122022122).

The spelling of 11001012111 in words is "eleven billion, one million, twelve thousand, one hundred eleven".

Divisors: 1 3 9 27 2833 8499 25497 76491 143821 431463 1294389 3883167 407444893 1222334679 3667004037 11001012111