Base | Representation |
---|---|
bin | 11001011101110110111101… |
… | …000000100010000111000101 |
3 | 112200120101101221220201210122 |
4 | 121131312331000202013011 |
5 | 104140024203000230313 |
6 | 1034113252205031325 |
7 | 32406644401062425 |
oct | 3135667500420705 |
9 | 480511357821718 |
10 | 112003033211333 |
11 | 32762246375600 |
12 | 1068ab31255545 |
13 | 4a65ac1077924 |
14 | 1d92d935a0485 |
15 | ce36c8b44708 |
hex | 65ddbd0221c5 |
112003033211333 has 24 divisors (see below), whose sum is σ = 129604499892000. Its totient is φ = 96451362485280.
The previous prime is 112003033211239. The next prime is 112003033211387. The reversal of 112003033211333 is 333112330300211.
It is not a de Polignac number, because 112003033211333 - 240 = 110903521583557 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112003033211033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 18329618 + ... + 23663916.
It is an arithmetic number, because the mean of its divisors is an integer number (5400187495500).
Almost surely, 2112003033211333 is an apocalyptic number.
It is an amenable number.
112003033211333 is a deficient number, since it is larger than the sum of its proper divisors (17601466680667).
112003033211333 is a wasteful number, since it uses less digits than its factorization.
112003033211333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5343473 (or 5343462 counting only the distinct ones).
The product of its (nonzero) digits is 2916, while the sum is 26.
Adding to 112003033211333 its reverse (333112330300211), we get a palindrome (445115363511544).
The spelling of 112003033211333 in words is "one hundred twelve trillion, three billion, thirty-three million, two hundred eleven thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •