Base | Representation |
---|---|
bin | 11001100001010110011100… |
… | …110111110011011000000101 |
3 | 112201102022211111202111200100 |
4 | 121201112130313303120011 |
5 | 104202442142112023141 |
6 | 1034415421124034313 |
7 | 32433201323023305 |
oct | 3141263467633005 |
9 | 481368744674610 |
10 | 112243012220421 |
11 | 32844aa3257a85 |
12 | 10709545832999 |
13 | 4a82616ca9ba4 |
14 | 1da083b147605 |
15 | ce9a71d060b6 |
hex | 66159cdf3605 |
112243012220421 has 48 divisors (see below), whose sum is σ = 178478234887680. Its totient is φ = 67664824519680.
The previous prime is 112243012220419. The next prime is 112243012220447. The reversal of 112243012220421 is 124022210342211.
112243012220421 is a `hidden beast` number, since 1 + 1 + 2 + 2 + 4 + 3 + 0 + 12 + 220 + 421 = 666.
It is not a de Polignac number, because 112243012220421 - 21 = 112243012220419 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112243012221421) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 84466560 + ... + 85785113.
It is an arithmetic number, because the mean of its divisors is an integer number (3718296560160).
Almost surely, 2112243012220421 is an apocalyptic number.
It is an amenable number.
112243012220421 is a deficient number, since it is larger than the sum of its proper divisors (66235222667259).
112243012220421 is a wasteful number, since it uses less digits than its factorization.
112243012220421 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 170251866 (or 170251863 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 112243012220421 its reverse (124022210342211), we get a palindrome (236265222562632).
The spelling of 112243012220421 in words is "one hundred twelve trillion, two hundred forty-three billion, twelve million, two hundred twenty thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •