Base | Representation |
---|---|
bin | 11001011111011011101100… |
… | …111010111000110000100001 |
3 | 112200221201122001220221221021 |
4 | 121133123230322320300201 |
5 | 104143312230033020001 |
6 | 1034235102431125441 |
7 | 32420524220014000 |
oct | 3137335472706041 |
9 | 480851561827837 |
10 | 112111211220001 |
11 | 327a4109000654 |
12 | 106a7aa1973881 |
13 | 4a73070c54b46 |
14 | 1d982d67c4c37 |
15 | ce640acdcba1 |
hex | 65f6eceb8c21 |
112111211220001 has 32 divisors (see below), whose sum is σ = 130830798240000. Its totient is φ = 96030029483136.
The previous prime is 112111211219999. The next prime is 112111211220011. The reversal of 112111211220001 is 100022112111211.
It is not a de Polignac number, because 112111211220001 - 21 = 112111211219999 is a prime.
It is a super-2 number, since 2×1121112112200012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112111211220011) 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, 5157135790 + ... + 5157157528.
It is an arithmetic number, because the mean of its divisors is an integer number (4088462445000).
Almost surely, 2112111211220001 is an apocalyptic number.
It is an amenable number.
112111211220001 is a deficient number, since it is larger than the sum of its proper divisors (18719587019999).
112111211220001 is an equidigital number, since it uses as much as digits as its factorization.
112111211220001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31286 (or 31272 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112111211220001 its reverse (100022112111211), we get a palindrome (212133323331212).
The spelling of 112111211220001 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred eleven million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •