Base | Representation |
---|---|
bin | 11001100001000010000010… |
… | …111010111100011111100101 |
3 | 112201100020021112210222202212 |
4 | 121201002002322330133211 |
5 | 104202112304103000401 |
6 | 1034401355040013205 |
7 | 32431464344152043 |
oct | 3141020272743745 |
9 | 481306245728685 |
10 | 112221102000101 |
11 | 3283677a532186 |
12 | 10705250001205 |
13 | 4a80534930793 |
14 | 1d9d75d297393 |
15 | ce91dd50ddbb |
hex | 661082ebc7e5 |
112221102000101 has 16 divisors (see below), whose sum is σ = 118292719359360. Its totient is φ = 106166015841600.
The previous prime is 112221102000047. The next prime is 112221102000131. The reversal of 112221102000101 is 101000201122211.
It is a cyclic number.
It is not a de Polignac number, because 112221102000101 - 214 = 112221101983717 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112221102000131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 907134551 + ... + 907258251.
It is an arithmetic number, because the mean of its divisors is an integer number (7393294959960).
Almost surely, 2112221102000101 is an apocalyptic number.
It is an amenable number.
112221102000101 is a deficient number, since it is larger than the sum of its proper divisors (6071617359259).
112221102000101 is a wasteful number, since it uses less digits than its factorization.
112221102000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 190124.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112221102000101 its reverse (101000201122211), we get a palindrome (213221303122312).
The spelling of 112221102000101 in words is "one hundred twelve trillion, two hundred twenty-one billion, one hundred two million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •