Base | Representation |
---|---|
bin | 1010000000010010010001… |
… | …1010010001000000000001 |
3 | 1102221120222110020222211001 |
4 | 2200010210122101000001 |
5 | 2420211021130011314 |
6 | 35221201305252001 |
7 | 2213503542131506 |
oct | 240044432210001 |
9 | 42846873228731 |
10 | 11000022110209 |
11 | 35610a0790710 |
12 | 1297a65194001 |
13 | 61a3b3b95b12 |
14 | 2a059248d4ad |
15 | 1412085c5674 |
hex | a0124691001 |
11000022110209 has 8 divisors (see below), whose sum is σ = 12020467098528. Its totient is φ = 9982984284960.
The previous prime is 11000022110149. The next prime is 11000022110257. The reversal of 11000022110209 is 90201122000011.
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 a de Polignac number, because none of the positive numbers 2k-11000022110209 is a prime.
It is a super-2 number, since 2×110000221102092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11000022110269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 851784012 + ... + 851796925.
It is an arithmetic number, because the mean of its divisors is an integer number (1502558387316).
Almost surely, 211000022110209 is an apocalyptic number.
It is an amenable number.
11000022110209 is a deficient number, since it is larger than the sum of its proper divisors (1020444988319).
11000022110209 is a wasteful number, since it uses less digits than its factorization.
11000022110209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1703581535.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 11000022110209 in words is "eleven trillion, twenty-two million, one hundred ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •