Base | Representation |
---|---|
bin | 11001011110001000101101… |
… | …100010110101010001100111 |
3 | 112200122012121211112212020222 |
4 | 121132020231202311101213 |
5 | 104140332230341320403 |
6 | 1034130124240314555 |
7 | 32411221044452246 |
oct | 3136105542652147 |
9 | 480565554485228 |
10 | 112022101120103 |
11 | 3276a340743699 |
12 | 10692773012a5b |
13 | 4a6783c601095 |
14 | 1d93c81b7495d |
15 | ce3e42b45338 |
hex | 65e22d8b5467 |
112022101120103 has 32 divisors (see below), whose sum is σ = 120894436474560. Its totient is φ = 103591508106240.
The previous prime is 112022101120063. The next prime is 112022101120133. The reversal of 112022101120103 is 301021101220211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112022101120103 - 220 = 112022100071527 is a prime.
It is a super-2 number, since 2×1120221011201032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112022101120133) 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, 20941601 + ... + 25740917.
It is an arithmetic number, because the mean of its divisors is an integer number (3777951139830).
Almost surely, 2112022101120103 is an apocalyptic number.
112022101120103 is a deficient number, since it is larger than the sum of its proper divisors (8872335354457).
112022101120103 is a wasteful number, since it uses less digits than its factorization.
112022101120103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4799747.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 112022101120103 its reverse (301021101220211), we get a palindrome (413043202340314).
The spelling of 112022101120103 in words is "one hundred twelve trillion, twenty-two billion, one hundred one million, one hundred twenty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •