Base | Representation |
---|---|
bin | 11001011101111110010111… |
… | …111011101100110011100110 |
3 | 112200121010222020221112102221 |
4 | 121131332113323230303212 |
5 | 104140142012241401042 |
6 | 1034121051001022554 |
7 | 32410346012152642 |
oct | 3135762773546346 |
9 | 480533866845387 |
10 | 112011001122022 |
11 | 32765665015862 |
12 | 10690595784a5a |
13 | 4a66790a63a92 |
14 | 1d9350b8b3c22 |
15 | ce39e3401d67 |
hex | 65df97eecce6 |
112011001122022 has 8 divisors (see below), whose sum is σ = 168016756290336. Its totient is φ = 56005415691912.
The previous prime is 112011001121951. The next prime is 112011001122091. The reversal of 112011001122022 is 220221100110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1120110011220222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112011001121987 and 112011001122005.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40771758 + ... + 43432225.
It is an arithmetic number, because the mean of its divisors is an integer number (21002094536292).
Almost surely, 2112011001122022 is an apocalyptic number.
112011001122022 is a deficient number, since it is larger than the sum of its proper divisors (56005755168314).
112011001122022 is an equidigital number, since it uses as much as digits as its factorization.
112011001122022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84869102.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112011001122022 its reverse (220221100110211), we get a palindrome (332232101232233).
The spelling of 112011001122022 in words is "one hundred twelve trillion, eleven billion, one million, one hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •