Base | Representation |
---|---|
bin | 1010000000111011100101… |
… | …0111110010110101001001 |
3 | 1102222122121021100020011220 |
4 | 2200032321113302311021 |
5 | 2420401223431431441 |
6 | 35230233515112253 |
7 | 2214345412635522 |
oct | 240167127626511 |
9 | 42878537306156 |
10 | 11011111202121 |
11 | 356587123a588 |
12 | 129a03aa42689 |
13 | 61b4603b4c74 |
14 | 2a0d25111849 |
15 | 141656db2466 |
hex | a03b95f2d49 |
11011111202121 has 32 divisors (see below), whose sum is σ = 14942522770560. Its totient is φ = 7211265191424.
The previous prime is 11011111202071. The next prime is 11011111202129. The reversal of 11011111202121 is 12120211111011.
11011111202121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 11011111202121 - 26 = 11011111202057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11011111202121.
It is not an unprimeable number, because it can be changed into a prime (11011111202129) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 84944085 + ... + 85073613.
It is an arithmetic number, because the mean of its divisors is an integer number (466953836580).
Almost surely, 211011111202121 is an apocalyptic number.
It is an amenable number.
11011111202121 is a deficient number, since it is larger than the sum of its proper divisors (3931411568439).
11011111202121 is a wasteful number, since it uses less digits than its factorization.
11011111202121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 131545.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11011111202121 its reverse (12120211111011), we get a palindrome (23131322313132).
The spelling of 11011111202121 in words is "eleven trillion, eleven billion, one hundred eleven million, two hundred two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •