Base | Representation |
---|---|
bin | 10100011111011100… |
… | …10100110001110011 |
3 | 1001101200201220001102 |
4 | 22033232110301303 |
5 | 140012303021321 |
6 | 5015350155015 |
7 | 536422554212 |
oct | 121756246163 |
9 | 31350656042 |
10 | 11001220211 |
11 | 47359a1633 |
12 | 2170352a6b |
13 | 1064263b77 |
14 | 76510b079 |
15 | 445c30c0b |
hex | 28fb94c73 |
11001220211 has 8 divisors (see below), whose sum is σ = 11028721200. Its totient is φ = 10973751840.
The previous prime is 11001220159. The next prime is 11001220247. The reversal of 11001220211 is 11202210011.
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 11001220211 - 230 = 9927478387 is a prime.
It is a super-2 number, since 2×110012202112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001220192 and 11001220201.
It is not an unprimeable number, because it can be changed into a prime (11001220271) 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 7 ways as a sum of consecutive naturals, for example, 753521 + ... + 767981.
It is an arithmetic number, because the mean of its divisors is an integer number (1378590150).
Almost surely, 211001220211 is an apocalyptic number.
11001220211 is a deficient number, since it is larger than the sum of its proper divisors (27500989).
11001220211 is a wasteful number, since it uses less digits than its factorization.
11001220211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16309.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11001220211 its reverse (11202210011), we get a palindrome (22203430222).
The spelling of 11001220211 in words is "eleven billion, one million, two hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •