Base | Representation |
---|---|
bin | 11001011101111110010111… |
… | …111111000011011011010110 |
3 | 112200121010222022121012022202 |
4 | 121131332113333003123112 |
5 | 104140142013003013420 |
6 | 1034121051031524502 |
7 | 32410346022503612 |
oct | 3135762777033326 |
9 | 480533868535282 |
10 | 112011002001110 |
11 | 32765665566283 |
12 | 10690595b29732 |
13 | 4a66790cb0c54 |
14 | 1d9350ba62342 |
15 | ce39e3527575 |
hex | 65df97fc36d6 |
112011002001110 has 16 divisors (see below), whose sum is σ = 201620952577296. Its totient is φ = 44804145472608.
The previous prime is 112011002001109. The next prime is 112011002001113. The reversal of 112011002001110 is 11100200110211.
It is a junction number, because it is equal to n+sod(n) for n = 112011002001091 and 112011002001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011002001113) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 30068369 + ... + 33587628.
It is an arithmetic number, because the mean of its divisors is an integer number (12601309536081).
Almost surely, 2112011002001110 is an apocalyptic number.
112011002001110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112011002001110 is a deficient number, since it is larger than the sum of its proper divisors (89609950576186).
112011002001110 is a wasteful number, since it uses less digits than its factorization.
112011002001110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 63831967.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 112011002001110 its reverse (11100200110211), we get a palindrome (123111202111321).
The spelling of 112011002001110 in words is "one hundred twelve trillion, eleven billion, two million, one thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •