Base | Representation |
---|---|
bin | 1010000001100000111000… |
… | …0011111111111111110001 |
3 | 1110000121102221110000110121 |
4 | 2200120032003333333301 |
5 | 2421032224213323441 |
6 | 35235011125330241 |
7 | 2215151451256555 |
oct | 240301603777761 |
9 | 43017387400417 |
10 | 11021122011121 |
11 | 356a039067552 |
12 | 129bb73566981 |
13 | 61c3973b82a1 |
14 | 2a15d4889865 |
15 | 141a40ba7dd1 |
hex | a060e0ffff1 |
11021122011121 has 8 divisors (see below), whose sum is σ = 11101585455360. Its totient is φ = 10940815264752.
The previous prime is 11021122011113. The next prime is 11021122011143. The reversal of 11021122011121 is 12111022112011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11021122011121 - 23 = 11021122011113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11021122011095 and 11021122011104.
It is not an unprimeable number, because it can be changed into a prime (11021122011181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39033286 + ... + 39314623.
It is an arithmetic number, because the mean of its divisors is an integer number (1387698181920).
Almost surely, 211021122011121 is an apocalyptic number.
It is an amenable number.
11021122011121 is a deficient number, since it is larger than the sum of its proper divisors (80463444239).
11021122011121 is an equidigital number, since it uses as much as digits as its factorization.
11021122011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78348935.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11021122011121 its reverse (12111022112011), we get a palindrome (23132144123132).
The spelling of 11021122011121 in words is "eleven trillion, twenty-one billion, one hundred twenty-two million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •