Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …010001101001000011011010 |
3 | 112200120002120122022110102110 |
4 | 121131310020101221003122 |
5 | 104140002000230120442 |
6 | 1034112031250413150 |
7 | 32406506301634005 |
oct | 3135641021510332 |
9 | 480502518273373 |
10 | 112000001020122 |
11 | 32760a2a818456 |
12 | 1068a4258911b6 |
13 | 4a65729b01c47 |
14 | 1d92b869b853c |
15 | ce359c84269c |
hex | 65dd084690da |
112000001020122 has 16 divisors (see below), whose sum is σ = 225125630193600. Its totient is φ = 37145728981152.
The previous prime is 112000001020003. The next prime is 112000001020129. The reversal of 112000001020122 is 221020100000211.
112000001020122 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 112000001020098 and 112000001020107.
It is not an unprimeable number, because it can be changed into a prime (112000001020129) 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, 46901171763 + ... + 46901174150.
It is an arithmetic number, because the mean of its divisors is an integer number (14070351887100).
Almost surely, 2112000001020122 is an apocalyptic number.
112000001020122 is an abundant number, since it is smaller than the sum of its proper divisors (113125629173478).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112000001020122 is a wasteful number, since it uses less digits than its factorization.
112000001020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93802346117.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 112000001020122 its reverse (221020100000211), we get a palindrome (333020101020333).
The spelling of 112000001020122 in words is "one hundred twelve trillion, one million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •