Search a number
BaseRepresentation
bin10000000001011000110…
…001111011010111011001
310220020212122211110211222
4100001120301323113121
5121014322241023001
62201443134501425
7142354556013341
oct20013061732731
93806778743758
101101001111001
11394a28473560
1215946b064875
137ca9331404c
143b408423d21
151d98d80161b
hex10058c7b5d9

1101001111001 has 32 divisors (see below), whose sum is σ = 1278972235776. Its totient is φ = 938522376000.

The previous prime is 1101001110997. The next prime is 1101001111003. The reversal of 1101001111001 is 1001111001011.

Adding to 1101001111001 its reverse (1001111001011), we get a palindrome (2102112112012).

It is not a de Polignac number, because 1101001111001 - 22 = 1101001110997 is a prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1101001111001.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 998666 + ... + 1788668.

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

Almost surely, 21101001111001 is an apocalyptic number.

1101001111001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 790173.

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

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