Base | Representation |
---|---|
bin | 1010000110001110001101… |
… | …1111001111110101011101 |
3 | 1110022100020022102220121222 |
4 | 2201203203133033311131 |
5 | 2423343410100042341 |
6 | 35340105521103125 |
7 | 2224044131631242 |
oct | 241434337176535 |
9 | 43270208386558 |
10 | 11102012112221 |
11 | 35a0378454778 |
12 | 12b3789487aa5 |
13 | 626bb8a5bc34 |
14 | 2a54a99255c9 |
15 | 143bc739a44b |
hex | a18e37cfd5d |
11102012112221 has 32 divisors (see below), whose sum is σ = 12617581173120. Its totient is φ = 9705007872000.
The previous prime is 11102012112199. The next prime is 11102012112229. The reversal of 11102012112221 is 12221121020111.
It is a de Polignac number, because none of the positive numbers 2k-11102012112221 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11102012112221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11102012112229) 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, 5131121 + ... + 6966521.
It is an arithmetic number, because the mean of its divisors is an integer number (394299411660).
Almost surely, 211102012112221 is an apocalyptic number.
It is an amenable number.
11102012112221 is a deficient number, since it is larger than the sum of its proper divisors (1515569060899).
11102012112221 is a wasteful number, since it uses less digits than its factorization.
11102012112221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1835805.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 11102012112221 its reverse (12221121020111), we get a palindrome (23323133132332).
The spelling of 11102012112221 in words is "eleven trillion, one hundred two billion, twelve million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •