Base | Representation |
---|---|
bin | 1010000000111011010000… |
… | …0000001010101001000111 |
3 | 1102222122100222211200122112 |
4 | 2200032310000022221013 |
5 | 2420401032401401434 |
6 | 35230220540251235 |
7 | 2214343240160564 |
oct | 240166400125107 |
9 | 42878328750575 |
10 | 11011021122119 |
11 | 35658254040a7 |
12 | 129a014840b1b |
13 | 61b4478357a5 |
14 | 2a0d1718386b |
15 | 14164e01bdce |
hex | a03b400aa47 |
11011021122119 has 4 divisors (see below), whose sum is σ = 11028867186144. Its totient is φ = 10993175058096.
The previous prime is 11011021122107. The next prime is 11011021122181. The reversal of 11011021122119 is 91122112011011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11011021122119 - 212 = 11011021118023 is a prime.
It is a super-2 number, since 2×110110211221192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011021122094 and 11011021122103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11011021124119) 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, 8923031087 + ... + 8923032320.
It is an arithmetic number, because the mean of its divisors is an integer number (2757216796536).
Almost surely, 211011021122119 is an apocalyptic number.
11011021122119 is a deficient number, since it is larger than the sum of its proper divisors (17846064025).
11011021122119 is an equidigital number, since it uses as much as digits as its factorization.
11011021122119 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17846064024.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 11011021122119 in words is "eleven trillion, eleven billion, twenty-one million, one hundred twenty-two thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •