Base | Representation |
---|---|
bin | 110100001101001010… |
… | …1111010010100010001 |
3 | 101201101012211000210110 |
4 | 1220122111322110101 |
5 | 3314100420214301 |
6 | 123300401551533 |
7 | 11046134431311 |
oct | 1503225722421 |
9 | 351335730713 |
10 | 112111101201 |
11 | 43600880750 |
12 | 198899455a9 |
13 | a7589a3908 |
14 | 55d771d441 |
15 | 2db26040d6 |
hex | 1a1a57a511 |
112111101201 has 16 divisors (see below), whose sum is σ = 163076302080. Its totient is φ = 67943784720.
The previous prime is 112111101161. The next prime is 112111101211. The reversal of 112111101201 is 102101111211.
It is not a de Polignac number, because 112111101201 - 211 = 112111099153 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112111101211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1761390 + ... + 1823928.
It is an arithmetic number, because the mean of its divisors is an integer number (10192268880).
Almost surely, 2112111101201 is an apocalyptic number.
112111101201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112111101201 is a deficient number, since it is larger than the sum of its proper divisors (50965200879).
112111101201 is a wasteful number, since it uses less digits than its factorization.
112111101201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116876.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 112111101201 its reverse (102101111211), we get a palindrome (214212212412).
It can be divided in two parts, 112111 and 101201, that added together give a palindrome (213312).
The spelling of 112111101201 in words is "one hundred twelve billion, one hundred eleven million, one hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •