Base | Representation |
---|---|
bin | 11001100000101111010101… |
… | …111100010001010110001111 |
3 | 112201021022110000000201010012 |
4 | 121200233111330101112033 |
5 | 104201300142111120421 |
6 | 1034344234221303435 |
7 | 32430153605144321 |
oct | 3140572574212617 |
9 | 481238400021105 |
10 | 112201020020111 |
11 | 328292047aa400 |
12 | 10701386704b7b |
13 | 4a7b684281499 |
14 | 1d9c7b6151611 |
15 | ce891549c95b |
hex | 660bd5f1158f |
112201020020111 has 18 divisors (see below), whose sum is σ = 131009747200920. Its totient is φ = 96000872714560.
The previous prime is 112201020020107. The next prime is 112201020020119. The reversal of 112201020020111 is 111020020102211.
It is not a de Polignac number, because 112201020020111 - 22 = 112201020020107 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 (112201020020119) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 1604257691 + ... + 1604327628.
It is an arithmetic number, because the mean of its divisors is an integer number (7278319288940).
Almost surely, 2112201020020111 is an apocalyptic number.
112201020020111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112201020020111 is a deficient number, since it is larger than the sum of its proper divisors (18808727180809).
112201020020111 is a wasteful number, since it uses less digits than its factorization.
112201020020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3208585375 (or 3208585347 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112201020020111 its reverse (111020020102211), we get a palindrome (223221040122322).
The spelling of 112201020020111 in words is "one hundred twelve trillion, two hundred one billion, twenty million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •