Search a number
-
+
11011010001111 = 324903249529993
BaseRepresentation
bin1010000000111011001101…
…0101101111100011010111
31102222122100012220200111100
42200032303111233203113
52420401022030013421
635230215502041143
72214343043512041
oct240166325574327
942878305820440
1011011010001111
11356581a0a878a
12129a010b791b3
1361b445440903
142a0d158caa91
1514164d071c26
hexa03b356f8d7

11011010001111 has 12 divisors (see below), whose sum is σ = 15908036177488. Its totient is φ = 7339176124704.

The previous prime is 11011010001109. The next prime is 11011010001133. The reversal of 11011010001111 is 11110001011011.

It is not a de Polignac number, because 11011010001111 - 21 = 11011010001109 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 = 11011010001093 and 11011010001102.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 124720870 + ... + 124809123.

Almost surely, 211011010001111 is an apocalyptic number.

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

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

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

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

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

Adding to 11011010001111 its reverse (11110001011011), we get a palindrome (22121011012122).

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

Divisors: 1 3 9 4903 14709 44127 249529993 748589979 2245769937 1223445555679 3670336667037 11011010001111