Base | Representation |
---|---|
bin | 11001011101110101000101… |
… | …000100101000111110011110 |
3 | 112200120012012201121221002212 |
4 | 121131311011010220332132 |
5 | 104140011042340201420 |
6 | 1034112320404520422 |
7 | 32406543465542513 |
oct | 3135650504507636 |
9 | 480505181557085 |
10 | 112001021022110 |
11 | 32761403563000 |
12 | 1068a66b3b0112 |
13 | 4a6586022340c |
14 | 1d92c4225130a |
15 | ce360c1753c5 |
hex | 65dd45128f9e |
112001021022110 has 32 divisors (see below), whose sum is σ = 221746875005664. Its totient is φ = 40727644003200.
The previous prime is 112001021022083. The next prime is 112001021022161. The reversal of 112001021022110 is 11220120100211.
It is a super-2 number, since 2×1120010210221102 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4207387931 + ... + 4207414550.
It is an arithmetic number, because the mean of its divisors is an integer number (6929589843927).
Almost surely, 2112001021022110 is an apocalyptic number.
112001021022110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112001021022110 is a deficient number, since it is larger than the sum of its proper divisors (109745853983554).
112001021022110 is an equidigital number, since it uses as much as digits as its factorization.
112001021022110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8414802521 (or 8414802499 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112001021022110 its reverse (11220120100211), we get a palindrome (123221141122321).
The spelling of 112001021022110 in words is "one hundred twelve trillion, one billion, twenty-one million, twenty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •