Base | Representation |
---|---|
bin | 11001011101110101010000… |
… | …111011101100000011011011 |
3 | 112200120012201121001011012211 |
4 | 121131311100323230003123 |
5 | 104140011444310031021 |
6 | 1034112352233415551 |
7 | 32406551433051034 |
oct | 3135652073540333 |
9 | 480505647034184 |
10 | 112001220002011 |
11 | 327614a59095aa |
12 | 1068a705b6a5b7 |
13 | 4a658925112c2 |
14 | 1d92c60849a8b |
15 | ce361e87c3e1 |
hex | 65dd50eec0db |
112001220002011 has 8 divisors (see below), whose sum is σ = 116871270050304. Its totient is φ = 107131205936040.
The previous prime is 112001220001999. The next prime is 112001220002059. The reversal of 112001220002011 is 110200022100211.
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 112001220002011 - 27 = 112001220001883 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112001220001982 and 112001220002000.
It is not an unprimeable number, because it can be changed into a prime (112001220002411) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2536195 + ... + 15180076.
It is an arithmetic number, because the mean of its divisors is an integer number (14608908756288).
Almost surely, 2112001220002011 is an apocalyptic number.
112001220002011 is a deficient number, since it is larger than the sum of its proper divisors (4870050048293).
112001220002011 is a wasteful number, since it uses less digits than its factorization.
112001220002011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17991161.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112001220002011 its reverse (110200022100211), we get a palindrome (222201242102222).
The spelling of 112001220002011 in words is "one hundred twelve trillion, one billion, two hundred twenty million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •