Base | Representation |
---|---|
bin | 11001011111011100011101… |
… | …010000100111000100110111 |
3 | 112200221210201120222002022102 |
4 | 121133130131100213010313 |
5 | 104143320410142033421 |
6 | 1034235315121452315 |
7 | 32420553265266503 |
oct | 3137343520470467 |
9 | 480853646862272 |
10 | 112112022221111 |
11 | 327a4494875800 |
12 | 106a80894a109b |
13 | 4a7316cc8a163 |
14 | 1d983723b5303 |
15 | ce64570d960b |
hex | 65f71d427137 |
112112022221111 has 24 divisors (see below), whose sum is σ = 124481762512800. Its totient is φ = 100887013339200.
The previous prime is 112112022221021. The next prime is 112112022221117. The reversal of 112112022221111 is 111122220211211.
It is a happy number.
It is not a de Polignac number, because 112112022221111 - 218 = 112112021958967 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112112022221117) 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, 9475445 + ... + 17720273.
It is an arithmetic number, because the mean of its divisors is an integer number (5186740104700).
Almost surely, 2112112022221111 is an apocalyptic number.
112112022221111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112112022221111 is a deficient number, since it is larger than the sum of its proper divisors (12369740291689).
112112022221111 is a wasteful number, since it uses less digits than its factorization.
112112022221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8245991 (or 8245980 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 112112022221111 its reverse (111122220211211), we get a palindrome (223234242432322).
The spelling of 112112022221111 in words is "one hundred twelve trillion, one hundred twelve billion, twenty-two million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •