Base | Representation |
---|---|
bin | 11001011111101110011010… |
… | …010111010110111001001101 |
3 | 112201000122111011102002022100 |
4 | 121133232122113112321031 |
5 | 104144124401024323041 |
6 | 1034252224125105313 |
7 | 32422135112303205 |
oct | 3137563227267115 |
9 | 481018434362270 |
10 | 112131301011021 |
11 | 32801688188a26 |
12 | 106ab9699b8239 |
13 | 4a74c2310a556 |
14 | 1d992809a1405 |
15 | ce6bd48936b6 |
hex | 65fb9a5d6e4d |
112131301011021 has 24 divisors (see below), whose sum is σ = 169933046366720. Its totient is φ = 71156827706400.
The previous prime is 112131301011001. The next prime is 112131301011043. The reversal of 112131301011021 is 120110103131211.
It is not a de Polignac number, because 112131301011021 - 213 = 112131301002829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112131301010985 and 112131301011003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112131301011001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3294280561 + ... + 3294314598.
Almost surely, 2112131301011021 is an apocalyptic number.
It is an amenable number.
112131301011021 is a deficient number, since it is larger than the sum of its proper divisors (57801745355699).
112131301011021 is a wasteful number, since it uses less digits than its factorization.
112131301011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6588595257 (or 6588595254 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
Adding to 112131301011021 its reverse (120110103131211), we get a palindrome (232241404142232).
The spelling of 112131301011021 in words is "one hundred twelve trillion, one hundred thirty-one billion, three hundred one million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •