Search a number
BaseRepresentation
bin10000000001011111010…
…101001010011010111001
310220021011022121222022100
4100001133111022122321
5121020033404323001
62201502102214013
7142360362110451
oct20013725123271
93807138558270
101101111011001
11394a84507001
1215949ba24309
137cab0012a31
143b418c70d61
151d9982ae586
hex1005f54a6b9

1101111011001 has 24 divisors (see below), whose sum is σ = 1594159688576. Its totient is φ = 732382469280.

The previous prime is 1101111010999. The next prime is 1101111011047. The reversal of 1101111011001 is 1001101111011.

It is not a de Polignac number, because 1101111011001 - 21 = 1101111010999 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 Curzon number.

It is not an unprimeable number, because it can be changed into a prime (1101111016001) 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 23 ways as a sum of consecutive naturals, for example, 37667571 + ... + 37696791.

Almost surely, 21101111011001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 1101111011001 its reverse (1001101111011), we get a palindrome (2102212122012).

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