Search a number
-
+
11021111001 = 324328478323
BaseRepresentation
bin10100100001110100…
…01100111011011001
31001110002011110002100
422100322030323121
5140032401023001
65021340354013
7540053616645
oct122072147331
931402143070
1011021111001
1147461478aa
122176b45909
131068409674
14767a07c25
1544785e586
hex290e8ced9

11021111001 has 12 divisors (see below), whose sum is σ = 16289601328. Its totient is φ = 7176537144.

The previous prime is 11021110957. The next prime is 11021111009. The reversal of 11021111001 is 10011112011.

11021111001 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11021111001 - 26 = 11021110937 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 (11021111009) by changing a digit.

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

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

Almost surely, 211021111001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11021111001 its reverse (10011112011), we get a palindrome (21032223012).

The spelling of 11021111001 in words is "eleven billion, twenty-one million, one hundred eleven thousand, one".

Divisors: 1 3 9 43 129 387 28478323 85434969 256304907 1224567889 3673703667 11021111001