Base | Representation |
---|---|
bin | 11001100011101011011110… |
… | …001101100000111110100101 |
3 | 112201222121211212210202012021 |
4 | 121203223132031200332211 |
5 | 104213102342142034341 |
6 | 1035021122513423141 |
7 | 32450564450421334 |
oct | 3143533615407645 |
9 | 481877755722167 |
10 | 112403022221221 |
11 | 328a6943780966 |
12 | 1073456086aab1 |
13 | 4a94737338834 |
14 | 1da849a101d1b |
15 | cedcd95bb9d1 |
hex | 663ade360fa5 |
112403022221221 has 8 divisors (see below), whose sum is σ = 118692216730080. Its totient is φ = 106151152309488.
The previous prime is 112403022221213. The next prime is 112403022221261. The reversal of 112403022221221 is 122122220304211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112403022221221 - 23 = 112403022221213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112403022221261) 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, 9331143091 + ... + 9331155136.
It is an arithmetic number, because the mean of its divisors is an integer number (14836527091260).
Almost surely, 2112403022221221 is an apocalyptic number.
It is an amenable number.
112403022221221 is a deficient number, since it is larger than the sum of its proper divisors (6289194508859).
112403022221221 is a wasteful number, since it uses less digits than its factorization.
112403022221221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18662298563.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 112403022221221 its reverse (122122220304211), we get a palindrome (234525242525432).
The spelling of 112403022221221 in words is "one hundred twelve trillion, four hundred three billion, twenty-two million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •