Base | Representation |
---|---|
bin | 110011101111011001… |
… | …1011110110111011001 |
3 | 101121210121020121112220 |
4 | 1213132303132313121 |
5 | 3310024212020441 |
6 | 123013320254253 |
7 | 11012315200500 |
oct | 1473663366731 |
9 | 347717217486 |
10 | 111112220121 |
11 | 43138a515a1 |
12 | 1964b311389 |
13 | a629a68b16 |
14 | 5540bc3837 |
15 | 2d54a94466 |
hex | 19decdedd9 |
111112220121 has 24 divisors (see below), whose sum is σ = 174518824320. Its totient is φ = 62688985632.
The previous prime is 111112220119. The next prime is 111112220123. The reversal of 111112220121 is 121022211111.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (111112220119) and next prime (111112220123).
It is not a de Polignac number, because 111112220121 - 21 = 111112220119 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111112220121.
It is not an unprimeable number, because it can be changed into a prime (111112220123) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4772346 + ... + 4795571.
It is an arithmetic number, because the mean of its divisors is an integer number (7271617680).
Almost surely, 2111112220121 is an apocalyptic number.
It is an amenable number.
111112220121 is a deficient number, since it is larger than the sum of its proper divisors (63406604199).
111112220121 is an equidigital number, since it uses as much as digits as its factorization.
111112220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9568013 (or 9568006 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111112220121 its reverse (121022211111), we get a palindrome (232134431232).
The spelling of 111112220121 in words is "one hundred eleven billion, one hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •