Search a number
-
+
11010211001 = 57120839257
BaseRepresentation
bin10100100000100001…
…00111110010111001
31001102022122200002122
422100100213302321
5140022103223001
65020311011025
7536562151346
oct122020476271
931368580078
1011010211001
11473aa82539
122173369a75
13106609126a
147663ab7cd
15446909b1b
hex290427cb9

11010211001 has 8 divisors (see below), whose sum is σ = 11035980384. Its totient is φ = 10984465440.

The previous prime is 11010210997. The next prime is 11010211031. The reversal of 11010211001 is 10011201011.

It is a happy number.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 11010211001 - 22 = 11010210997 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1184765 + ... + 1194021.

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

Almost surely, 211010211001 is an apocalyptic number.

It is an amenable number.

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

11010211001 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 11911.

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

Adding to 11010211001 its reverse (10011201011), we get a palindrome (21021412012).

The spelling of 11010211001 in words is "eleven billion, ten million, two hundred eleven thousand, one".

Divisors: 1 571 2083 9257 1189393 5285747 19282331 11010211001