Base | Representation |
---|---|
bin | 11001011101111110011110… |
… | …100010101010110111101001 |
3 | 112200121011020222120202210210 |
4 | 121131332132202222313221 |
5 | 104140142224133013001 |
6 | 1034121110001331333 |
7 | 32410351526465163 |
oct | 3135763642526751 |
9 | 480534228522723 |
10 | 112011112001001 |
11 | 32765711667884 |
12 | 10690606936b49 |
13 | 4a667aaa16245 |
14 | 1d9351c4d7933 |
15 | ce39ed004dd6 |
hex | 65df9e8aade9 |
112011112001001 has 8 divisors (see below), whose sum is σ = 150826843882944. Its totient is φ = 73934727393200.
The previous prime is 112011112000951. The next prime is 112011112001039. The reversal of 112011112001001 is 100100211110211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112011112001001 - 214 = 112011111984617 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112011112001081) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 184836818181 + ... + 184836818786.
It is an arithmetic number, because the mean of its divisors is an integer number (18853355485368).
Almost surely, 2112011112001001 is an apocalyptic number.
It is an amenable number.
112011112001001 is a deficient number, since it is larger than the sum of its proper divisors (38815731881943).
112011112001001 is a wasteful number, since it uses less digits than its factorization.
112011112001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 369673637071.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 112011112001001 its reverse (100100211110211), we get a palindrome (212111323111212).
The spelling of 112011112001001 in words is "one hundred twelve trillion, eleven billion, one hundred twelve million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •