Base | Representation |
---|---|
bin | 10100011111011011… |
… | …00100011100000011 |
3 | 1001101200100211110002 |
4 | 22033231210130003 |
5 | 140012230202321 |
6 | 5015342030215 |
7 | 536421101024 |
oct | 121755443403 |
9 | 31350324402 |
10 | 11001022211 |
11 | 47358768a3 |
12 | 217027836b |
13 | 10641c49ca |
14 | 765098c4b |
15 | 445be220b |
hex | 28fb64703 |
11001022211 has 8 divisors (see below), whose sum is σ = 11581867200. Its totient is φ = 10420361640.
The previous prime is 11001022183. The next prime is 11001022229. The reversal of 11001022211 is 11222010011.
11001022211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11001022211 - 230 = 9927280387 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11001022192 and 11001022201.
It is not an unprimeable number, because it can be changed into a prime (11001022411) 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 7 ways as a sum of consecutive naturals, for example, 86096 + ... + 171506.
It is an arithmetic number, because the mean of its divisors is an integer number (1447733400).
Almost surely, 211001022211 is an apocalyptic number.
11001022211 is a deficient number, since it is larger than the sum of its proper divisors (580844989).
11001022211 is an equidigital number, since it uses as much as digits as its factorization.
11001022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 92209.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11001022211 its reverse (11222010011), we get a palindrome (22223032222).
The spelling of 11001022211 in words is "eleven billion, one million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •