Base | Representation |
---|---|
bin | 110100001101011100… |
… | …0100111101110100101 |
3 | 101201101211221022010202 |
4 | 1220122320213232211 |
5 | 3314110232400401 |
6 | 123301325000245 |
7 | 11046304655600 |
oct | 1503270475645 |
9 | 351354838122 |
10 | 112120200101 |
11 | 43605a258a8 |
12 | 198909b3085 |
13 | a75a83b290 |
14 | 55d8a0b337 |
15 | 2db330006b |
hex | 1a1ae27ba5 |
112120200101 has 48 divisors (see below), whose sum is σ = 141998194800. Its totient is φ = 87740900352.
The previous prime is 112120200053. The next prime is 112120200149. The reversal of 112120200101 is 101002021211.
It is an interprime number because it is at equal distance from previous prime (112120200053) and next prime (112120200149).
It can be written as a sum of positive squares in 8 ways, for example, as 2261097601 + 109859102500 = 47551^2 + 331450^2 .
It is not a de Polignac number, because 112120200101 - 222 = 112116005797 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112120200161) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 53670665 + ... + 53672753.
It is an arithmetic number, because the mean of its divisors is an integer number (2958295725).
Almost surely, 2112120200101 is an apocalyptic number.
It is an amenable number.
112120200101 is a deficient number, since it is larger than the sum of its proper divisors (29877994699).
112120200101 is a wasteful number, since it uses less digits than its factorization.
112120200101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2998 (or 2991 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112120200101 its reverse (101002021211), we get a palindrome (213122221312).
The spelling of 112120200101 in words is "one hundred twelve billion, one hundred twenty million, two hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •