Base | Representation |
---|---|
bin | 11001011110001000110100… |
… | …000110000100010101001111 |
3 | 112200122012220111100100201122 |
4 | 121132020310012010111033 |
5 | 104140332442010120421 |
6 | 1034130143204031155 |
7 | 32411223550546400 |
oct | 3136106406042517 |
9 | 480565814310648 |
10 | 112022211020111 |
11 | 3276a397787147 |
12 | 106927a39924bb |
13 | 4a678592cca82 |
14 | 1d93c925c19a7 |
15 | ce3e4c6032ab |
hex | 65e23418454f |
112022211020111 has 12 divisors (see below), whose sum is σ = 133489882123920. Its totient is φ = 93677110259040.
The previous prime is 112022211020047. The next prime is 112022211020129. The reversal of 112022211020111 is 111020112220211.
It is not a de Polignac number, because 112022211020111 - 26 = 112022211020047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112022211020111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022211020191) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 27880090331 + ... + 27880094348.
It is an arithmetic number, because the mean of its divisors is an integer number (11124156843660).
Almost surely, 2112022211020111 is an apocalyptic number.
112022211020111 is a deficient number, since it is larger than the sum of its proper divisors (21467671103809).
112022211020111 is an equidigital number, since it uses as much as digits as its factorization.
112022211020111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 55760184734 (or 55760184727 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 112022211020111 its reverse (111020112220211), we get a palindrome (223042323240322).
The spelling of 112022211020111 in words is "one hundred twelve trillion, twenty-two billion, two hundred eleven million, twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •