Base | Representation |
---|---|
bin | 11001100000101110011010… |
… | …010101111010111101100001 |
3 | 112201021012212022112001221212 |
4 | 121200232122111322331201 |
5 | 104201241120122024301 |
6 | 1034343551101555505 |
7 | 32430120044103101 |
oct | 3140563225727541 |
9 | 481235768461855 |
10 | 112200020111201 |
11 | 32828841339000 |
12 | 10701147875b95 |
13 | 4a7b5550768c9 |
14 | 1d9c71d429201 |
15 | ce88a77d84bb |
hex | 660b9a57af61 |
112200020111201 has 32 divisors (see below), whose sum is σ = 129911820165120. Its totient is φ = 96627965694480.
The previous prime is 112200020111183. The next prime is 112200020111273. The reversal of 112200020111201 is 102111020002211.
It is not a de Polignac number, because 112200020111201 - 210 = 112200020110177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112200020111801) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 840716660 + ... + 840850106.
It is an arithmetic number, because the mean of its divisors is an integer number (4059744380160).
Almost surely, 2112200020111201 is an apocalyptic number.
112200020111201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112200020111201 is a deficient number, since it is larger than the sum of its proper divisors (17711800053919).
112200020111201 is a wasteful number, since it uses less digits than its factorization.
112200020111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166746 (or 166724 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112200020111201 its reverse (102111020002211), we get a palindrome (214311040113412).
The spelling of 112200020111201 in words is "one hundred twelve trillion, two hundred billion, twenty million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •