Search a number
-
+
11111111001 = 3212748719961
BaseRepresentation
bin10100101100100011…
…00001100101011001
31001200100111220212200
422112101201211121
5140223421023001
65034313400413
7542225612424
oct122621414531
931610456780
1011111111001
114791a29171
1221a1109109
131080c5b5c3
147759549bb
154506db086
hex296461959

11111111001 has 24 divisors (see below), whose sum is σ = 16209782784. Its totient is φ = 7333623360.

The previous prime is 11111110979. The next prime is 11111111059. The reversal of 11111111001 is 10011111111.

It is not a de Polignac number, because 11111111001 - 225 = 11077556569 is a prime.

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

It is a Curzon number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 546661 + ... + 566621.

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

Almost surely, 211111111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11111111001 its reverse (10011111111), we get a palindrome (21122222112).

It can be divided in two parts, 1111111 and 1001, that multiplied together give a palindrome (1112222111).

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

Divisors: 1 3 9 127 381 487 1143 1461 4383 19961 59883 61849 179649 185547 556641 2535047 7605141 9721007 22815423 29163021 87489063 1234567889 3703703667 11111111001