Base | Representation |
---|---|
bin | 1010000000111011111111… |
… | …0111101000010110100101 |
3 | 1102222122212212110110101211 |
4 | 2200032333313220112211 |
5 | 2420401434333223414 |
6 | 35230252411351421 |
7 | 2214351205332136 |
oct | 240167767502645 |
9 | 42878785413354 |
10 | 11011220211109 |
11 | 3565917824658 |
12 | 129a06b452571 |
13 | 61b479b61221 |
14 | 2a0d357a9c8d |
15 | 1416617463c4 |
hex | a03bfde85a5 |
11011220211109 has 2 divisors, whose sum is σ = 11011220211110. Its totient is φ = 11011220211108.
The previous prime is 11011220211107. The next prime is 11011220211151. The reversal of 11011220211109 is 90111202211011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6746891960484 + 4264328250625 = 2597478^2 + 2065025^2 .
It is a cyclic number.
It is not a de Polignac number, because 11011220211109 - 21 = 11011220211107 is a prime.
Together with 11011220211107, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11011220211109.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11011220211107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505610105554 + 5505610105555.
It is an arithmetic number, because the mean of its divisors is an integer number (5505610105555).
Almost surely, 211011220211109 is an apocalyptic number.
It is an amenable number.
11011220211109 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011220211109 is an equidigital number, since it uses as much as digits as its factorization.
11011220211109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 22.
The spelling of 11011220211109 in words is "eleven trillion, eleven billion, two hundred twenty million, two hundred eleven thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •