Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …111000011110011001111001 |
3 | 112200120002121100110122202110 |
4 | 121131310020320132121321 |
5 | 104140002010331400441 |
6 | 1034112032252522533 |
7 | 32406506454313212 |
oct | 3135641070363171 |
9 | 480502540418673 |
10 | 112000011200121 |
11 | 32760a35540880 |
12 | 1068a429180449 |
13 | 4a6572bc57705 |
14 | 1d92b880a8409 |
15 | ce359d6a3b16 |
hex | 65dd08e1e679 |
112000011200121 has 16 divisors (see below), whose sum is σ = 167312056045248. Its totient is φ = 66044232648000.
The previous prime is 112000011200113. The next prime is 112000011200123. The reversal of 112000011200121 is 121002110000211.
It is not a de Polignac number, because 112000011200121 - 23 = 112000011200113 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112000011200097 and 112000011200106.
It is not an unprimeable number, because it can be changed into a prime (112000011200123) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45864049230 + ... + 45864051671.
It is an arithmetic number, because the mean of its divisors is an integer number (10457003502828).
Almost surely, 2112000011200121 is an apocalyptic number.
112000011200121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112000011200121 is a deficient number, since it is larger than the sum of its proper divisors (55312044845127).
112000011200121 is a wasteful number, since it uses less digits than its factorization.
112000011200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91728100952.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112000011200121 its reverse (121002110000211), we get a palindrome (233002121200332).
The spelling of 112000011200121 in words is "one hundred twelve trillion, eleven million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •