Base | Representation |
---|---|
bin | 110011101100011010… |
… | …1111110101000010101 |
3 | 101121112122001122010120 |
4 | 1213120311332220111 |
5 | 3304323111224341 |
6 | 122555344542153 |
7 | 11006662140402 |
oct | 1473065765025 |
9 | 347478048116 |
10 | 111012211221 |
11 | 4309755440a |
12 | 19621921959 |
13 | a612121262 |
14 | 55317cd2a9 |
15 | 2d4addc066 |
hex | 19d8d7ea15 |
111012211221 has 16 divisors (see below), whose sum is σ = 160017604800. Its totient is φ = 68218028928.
The previous prime is 111012211181. The next prime is 111012211253. The reversal of 111012211221 is 122112210111.
It is a happy number.
It is not a de Polignac number, because 111012211221 - 26 = 111012211157 is a prime.
It is a super-2 number, since 2×1110122112212 (a number of 23 digits) contains 22 as substring.
111012211221 is a modest number, since divided by 12211221 gives 1110 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 111012211221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111012218221) 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, 26316576 + ... + 26320793.
It is an arithmetic number, because the mean of its divisors is an integer number (10001100300).
Almost surely, 2111012211221 is an apocalyptic number.
It is an amenable number.
111012211221 is a deficient number, since it is larger than the sum of its proper divisors (49005393579).
111012211221 is a wasteful number, since it uses less digits than its factorization.
111012211221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52637428.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111012211221 its reverse (122112210111), we get a palindrome (233124421332).
The spelling of 111012211221 in words is "one hundred eleven billion, twelve million, two hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •