Base | Representation |
---|---|
bin | 11001010000101111111001… |
… | …111010111001001111010101 |
3 | 112120101020222012201211120122 |
4 | 121100233321322321033111 |
5 | 104030244111133324341 |
6 | 1032143334453041325 |
7 | 32254601623165322 |
oct | 3120577172711725 |
9 | 476336865654518 |
10 | 111102112011221 |
11 | 32445160893501 |
12 | 10564400626245 |
13 | 49cbb657b16c6 |
14 | 1d61529addb49 |
15 | cca04a7ee94b |
hex | 650bf9eb93d5 |
111102112011221 has 16 divisors (see below), whose sum is σ = 113881696201728. Its totient is φ = 108340173801600.
The previous prime is 111102112011157. The next prime is 111102112011277. The reversal of 111102112011221 is 122110211201111.
It is a cyclic number.
It is not a de Polignac number, because 111102112011221 - 26 = 111102112011157 is a prime.
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 111102112011221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111102102011221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29732516 + ... + 33259986.
It is an arithmetic number, because the mean of its divisors is an integer number (7117606012608).
Almost surely, 2111102112011221 is an apocalyptic number.
It is an amenable number.
111102112011221 is a deficient number, since it is larger than the sum of its proper divisors (2779584190507).
111102112011221 is a wasteful number, since it uses less digits than its factorization.
111102112011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3529972.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 111102112011221 its reverse (122110211201111), we get a palindrome (233212323212332).
The spelling of 111102112011221 in words is "one hundred eleven trillion, one hundred two billion, one hundred twelve million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •