Base | Representation |
---|---|
bin | 1010000001100001001111… |
… | …1110011101011011011101 |
3 | 1110000121200212010110100122 |
4 | 2200120103332131123131 |
5 | 2421032430113101414 |
6 | 35235025032004325 |
7 | 2215154064454460 |
oct | 240302376353335 |
9 | 43017625113318 |
10 | 11021221222109 |
11 | 356a08a06a1aa |
12 | 129bba08306a5 |
13 | 61c3b1b13907 |
14 | 2a1603b132d7 |
15 | 141a49753b8e |
hex | a0613f9d6dd |
11021221222109 has 4 divisors (see below), whose sum is σ = 12595681396704. Its totient is φ = 9446761047516.
The previous prime is 11021221222057. The next prime is 11021221222111. The reversal of 11021221222109 is 90122212212011.
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 a cyclic number.
It is not a de Polignac number, because 11021221222109 - 212 = 11021221218013 is a prime.
It is a super-3 number, since 3×110212212221093 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11021221222129) 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, 787230087287 + ... + 787230087300.
It is an arithmetic number, because the mean of its divisors is an integer number (3148920349176).
Almost surely, 211021221222109 is an apocalyptic number.
It is an amenable number.
11021221222109 is a deficient number, since it is larger than the sum of its proper divisors (1574460174595).
11021221222109 is an equidigital number, since it uses as much as digits as its factorization.
11021221222109 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1574460174594.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 11021221222109 in words is "eleven trillion, twenty-one billion, two hundred twenty-one million, two hundred twenty-two thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.044 sec. • engine limits •