Search a number
-
+
11010010001 = 235914835471
BaseRepresentation
bin10100100000011111…
…10110101110010001
31001102022021110101012
422100033312232101
5140022030310001
65020302420305
7536560353344
oct122017665621
931368243335
1011010010001
11473a955521
122173291695
131066020923
1476635845b
154468ba2bb
hex2903f6b91

11010010001 has 16 divisors (see below), whose sum is σ = 11693445120. Its totient is φ = 10343945040.

The previous prime is 11010009991. The next prime is 11010010013. The reversal of 11010010001 is 10001001011.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-11010010001 is a prime.

It is a Duffinian number.

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

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

Almost surely, 211010010001 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 7036.

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

Adding to 11010010001 its reverse (10001001011), we get a palindrome (21011011012).

The spelling of 11010010001 in words is "eleven billion, ten million, ten thousand, one".

Divisors: 1 23 59 1357 1483 5471 34109 87497 125833 322789 2012431 7424147 8113493 186610339 478696087 11010010001