Base | Representation |
---|---|
bin | 11001100001000001111110… |
… | …000010100011110011000101 |
3 | 112201100020001211201112200221 |
4 | 121201001332002203303011 |
5 | 104202112122122010041 |
6 | 1034401342552504341 |
7 | 32431462331124334 |
oct | 3141017602436305 |
9 | 481306054645627 |
10 | 112221020110021 |
11 | 3283673828aa29 |
12 | 107052286ab0b1 |
13 | 4a8052098b004 |
14 | 1d9d75245bd1b |
15 | ce91d62352d1 |
hex | 66107e0a3cc5 |
112221020110021 has 32 divisors (see below), whose sum is σ = 115098430487040. Its totient is φ = 109386059268096.
The previous prime is 112221020109997. The next prime is 112221020110049. The reversal of 112221020110021 is 120011020122211.
It is a cyclic number.
It is not a de Polignac number, because 112221020110021 - 227 = 112220885892293 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112221020109977 and 112221020110004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112221020110081) 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, 5168368461 + ... + 5168390173.
It is an arithmetic number, because the mean of its divisors is an integer number (3596825952720).
Almost surely, 2112221020110021 is an apocalyptic number.
It is an amenable number.
112221020110021 is a deficient number, since it is larger than the sum of its proper divisors (2877410377019).
112221020110021 is an equidigital number, since it uses as much as digits as its factorization.
112221020110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23533.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112221020110021 its reverse (120011020122211), we get a palindrome (232232040232232).
The spelling of 112221020110021 in words is "one hundred twelve trillion, two hundred twenty-one billion, twenty million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •