Base | Representation |
---|---|
bin | 11001011111100011111000… |
… | …111001000101111111110010 |
3 | 112200222120022201100102022121 |
4 | 121133203320321011333302 |
5 | 104143433231003323442 |
6 | 1034243115020224454 |
7 | 32421255112344430 |
oct | 3137437071057762 |
9 | 480876281312277 |
10 | 112120002011122 |
11 | 327a790a19a086 |
12 | 106a973599b12a |
13 | 4a73b422753b1 |
14 | 1d988cc0dbd50 |
15 | ce6772941967 |
hex | 65f8f8e45ff2 |
112120002011122 has 8 divisors (see below), whose sum is σ = 192205717733376. Its totient is φ = 48051429433332.
The previous prime is 112120002011119. The next prime is 112120002011137. The reversal of 112120002011122 is 221110200021211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1121200020111222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112120002011096 and 112120002011105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4004285786098 + ... + 4004285786125.
It is an arithmetic number, because the mean of its divisors is an integer number (24025714716672).
Almost surely, 2112120002011122 is an apocalyptic number.
112120002011122 is a deficient number, since it is larger than the sum of its proper divisors (80085715722254).
112120002011122 is an equidigital number, since it uses as much as digits as its factorization.
112120002011122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8008571572232.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112120002011122 its reverse (221110200021211), we get a palindrome (333230202032333).
The spelling of 112120002011122 in words is "one hundred twelve trillion, one hundred twenty billion, two million, eleven thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •