Base | Representation |
---|---|
bin | 11001100001000010001000… |
… | …110100101011010011011001 |
3 | 112201100020112110010201201000 |
4 | 121201002020310223103121 |
5 | 104202113004430120441 |
6 | 1034401412534215213 |
7 | 32431466655623124 |
oct | 3141021064532331 |
9 | 481306473121630 |
10 | 112221201020121 |
11 | 32836820414406 |
12 | 107052791b4509 |
13 | 4a8054c2c01cb |
14 | 1d9d76c4b13bb |
15 | ce91e706d2b6 |
hex | 661088d2b4d9 |
112221201020121 has 32 divisors (see below), whose sum is σ = 175013526300800. Its totient is φ = 70872617874240.
The previous prime is 112221201020113. The next prime is 112221201020147. The reversal of 112221201020121 is 121020102122211.
It is not a de Polignac number, because 112221201020121 - 23 = 112221201020113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112221201020094 and 112221201020103.
It is not an unprimeable number, because it can be changed into a prime (112221201020101) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3209295 + ... + 15321291.
It is an arithmetic number, because the mean of its divisors is an integer number (5469172696900).
Almost surely, 2112221201020121 is an apocalyptic number.
It is an amenable number.
112221201020121 is a deficient number, since it is larger than the sum of its proper divisors (62792325280679).
112221201020121 is a wasteful number, since it uses less digits than its factorization.
112221201020121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12130086 (or 12130080 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 112221201020121 its reverse (121020102122211), we get a palindrome (233241303142332).
The spelling of 112221201020121 in words is "one hundred twelve trillion, two hundred twenty-one billion, two hundred one million, twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •