Base | Representation |
---|---|
bin | 10000000010100000010… |
… | …111011000010010010001 |
3 | 10220100222100201121021220 |
4 | 100002200113120102101 |
5 | 121024302220023441 |
6 | 2202202240235253 |
7 | 142426411235406 |
oct | 20024027302221 |
9 | 3810870647256 |
10 | 1102202111121 |
11 | 3954943a2741 |
12 | 15974530bb29 |
13 | 7cc250987c7 |
14 | 3b4bdb342ad |
15 | 1da0de88466 |
hex | 100a05d8491 |
1102202111121 has 16 divisors (see below), whose sum is σ = 1520382614400. Its totient is φ = 709414969088.
The previous prime is 1102202111107. The next prime is 1102202111159. The reversal of 1102202111121 is 1211112022011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1102202111121 - 29 = 1102202110609 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1102202111121.
It is not an unprimeable number, because it can be changed into a prime (1102202111821) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 870820 + ... + 1721258.
It is an arithmetic number, because the mean of its divisors is an integer number (95023913400).
Almost surely, 21102202111121 is an apocalyptic number.
It is an amenable number.
1102202111121 is a deficient number, since it is larger than the sum of its proper divisors (418180503279).
1102202111121 is a wasteful number, since it uses less digits than its factorization.
1102202111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 865368.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1102202111121 its reverse (1211112022011), we get a palindrome (2313314133132).
The spelling of 1102202111121 in words is "one trillion, one hundred two billion, two hundred two million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •