Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …1111100111111110110001 |
3 | 1110022100020022121221021221 |
4 | 2201203203133213332301 |
5 | 2423343410111223441 |
6 | 35340105523145041 |
7 | 2224044132522466 |
oct | 241434337477661 |
9 | 43270208557257 |
10 | 11102012211121 |
11 | 35a0378512007 |
12 | 12b3789515181 |
13 | 626bb8a94c60 |
14 | 2a54a994d66d |
15 | 143bc73b98d1 |
hex | a18e37e7fb1 |
11102012211121 has 8 divisors (see below), whose sum is σ = 11956117530560. Its totient is φ = 10247921803152.
The previous prime is 11102012211119. The next prime is 11102012211151. The reversal of 11102012211121 is 12111221020111.
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 11102012211121 - 21 = 11102012211119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11102012211095 and 11102012211104.
It is not an unprimeable number, because it can be changed into a prime (11102012211151) 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, 2157015 + ... + 5182348.
It is an arithmetic number, because the mean of its divisors is an integer number (1494514691320).
Almost surely, 211102012211121 is an apocalyptic number.
It is an amenable number.
11102012211121 is a deficient number, since it is larger than the sum of its proper divisors (854105319439).
11102012211121 is a wasteful number, since it uses less digits than its factorization.
11102012211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7455735.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11102012211121 its reverse (12111221020111), we get a palindrome (23213233231232).
The spelling of 11102012211121 in words is "eleven trillion, one hundred two billion, twelve million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •