Base | Representation |
---|---|
bin | 1010000000111011010000… |
… | …0011100011101011110001 |
3 | 1102222122101001111212010112 |
4 | 2200032310003203223301 |
5 | 2420401033113323441 |
6 | 35230221011311105 |
7 | 2214343250552456 |
oct | 240166403435361 |
9 | 42878331455115 |
10 | 11011022011121 |
11 | 3565825961010 |
12 | 129a014bab495 |
13 | 61b447a87322 |
14 | 2a0d1733582d |
15 | 14164e1454eb |
hex | a03b40e3af1 |
11011022011121 has 16 divisors (see below), whose sum is σ = 12025845869760. Its totient is φ = 9998504417280.
The previous prime is 11011022011109. The next prime is 11011022011139. The reversal of 11011022011121 is 12111022011011.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011022011121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11011022011096 and 11011022011105.
It is not an unprimeable number, because it can be changed into a prime (11011022011181) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 90418145 + ... + 90539841.
It is an arithmetic number, because the mean of its divisors is an integer number (751615366860).
Almost surely, 211011022011121 is an apocalyptic number.
11011022011121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11011022011121 is a deficient number, since it is larger than the sum of its proper divisors (1014823858639).
11011022011121 is a wasteful number, since it uses less digits than its factorization.
11011022011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131104.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11011022011121 its reverse (12111022011011), we get a palindrome (23122044022132).
The spelling of 11011022011121 in words is "eleven trillion, eleven billion, twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •