Base | Representation |
---|---|
bin | 11001011101111111010100… |
… | …000101000110100111110101 |
3 | 112200121020120120202000122220 |
4 | 121131333110011012213311 |
5 | 104140201044104020041 |
6 | 1034121335045312553 |
7 | 32410413014305422 |
oct | 3135772405064765 |
9 | 480536516660586 |
10 | 112012010220021 |
11 | 3276603269304a |
12 | 10690817705759 |
13 | 4a668c1b380a2 |
14 | 1d935a590cd49 |
15 | ce3a51ccdd66 |
hex | 65dfd41469f5 |
112012010220021 has 8 divisors (see below), whose sum is σ = 149349405944064. Its totient is φ = 74674643988000.
The previous prime is 112012010220001. The next prime is 112012010220041. The reversal of 112012010220021 is 120022010210211.
It is an interprime number because it is at equal distance from previous prime (112012010220001) and next prime (112012010220041).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112012010220021 - 29 = 112012010219509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112012010220001) 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, 3991521 + ... + 15490521.
It is an arithmetic number, because the mean of its divisors is an integer number (18668675743008).
Almost surely, 2112012010220021 is an apocalyptic number.
It is an amenable number.
112012010220021 is a deficient number, since it is larger than the sum of its proper divisors (37337395724043).
112012010220021 is a wasteful number, since it uses less digits than its factorization.
112012010220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14746011.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112012010220021 its reverse (120022010210211), we get a palindrome (232034020430232).
The spelling of 112012010220021 in words is "one hundred twelve trillion, twelve billion, ten million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •