Base | Representation |
---|---|
bin | 1010001101000101110000… |
… | …1111110011000000011101 |
3 | 1110201121210020122112012220 |
4 | 2203101130033303000131 |
5 | 2432312031032101414 |
6 | 35510221534415553 |
7 | 2235422054210562 |
oct | 243213417630035 |
9 | 43647706575186 |
10 | 11220002222109 |
11 | 363641582768a |
12 | 13126180615b9 |
13 | 6350707183c5 |
14 | 2ab09dd5a869 |
15 | 146cd0b87ca9 |
hex | a345c3f301d |
11220002222109 has 4 divisors (see below), whose sum is σ = 14960002962816. Its totient is φ = 7480001481404.
The previous prime is 11220002222089. The next prime is 11220002222129. The reversal of 11220002222109 is 90122220002211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (11220002222089) and next prime (11220002222129).
It is a cyclic number.
It is not a de Polignac number, because 11220002222109 - 227 = 11219868004381 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11220002222129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1870000370349 + ... + 1870000370354.
It is an arithmetic number, because the mean of its divisors is an integer number (3740000740704).
Almost surely, 211220002222109 is an apocalyptic number.
It is an amenable number.
11220002222109 is a deficient number, since it is larger than the sum of its proper divisors (3740000740707).
11220002222109 is an equidigital number, since it uses as much as digits as its factorization.
11220002222109 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3740000740706.
The product of its (nonzero) digits is 576, while the sum is 24.
The spelling of 11220002222109 in words is "eleven trillion, two hundred twenty billion, two million, two hundred twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •