Search a number
-
+
11010011111001 = 327174762081127
BaseRepresentation
bin1010000000110111011111…
…0011010001111001011001
31102222112202121022210212100
42200031313303101321121
52420342000321023001
635225532420234013
72214306224213010
oct240156763217131
942875677283770
1011010011111001
113565357272871
12129999253b909
1361b316501986
142a0c5cd8ba77
151415e050e586
hexa0377cd1e59

11010011111001 has 12 divisors (see below), whose sum is σ = 18175256437312. Its totient is φ = 6291434920536.

The previous prime is 11010011110999. The next prime is 11010011111063. The reversal of 11010011111001 is 10011111001011.

It is not a de Polignac number, because 11010011111001 - 21 = 11010011110999 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 not an unprimeable number, because it can be changed into a prime (11010011116001) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

Almost surely, 211010011111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11010011111001 its reverse (10011111001011), we get a palindrome (21021122112012).

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

Divisors: 1 3 7 9 21 63 174762081127 524286243381 1223334567889 1572858730143 3670003703667 11010011111001