Base | Representation |
---|---|
bin | 110100001010110000… |
… | …1000010001110110001 |
3 | 101201011120110022201121 |
4 | 1220111201002032301 |
5 | 3313414203143441 |
6 | 123244350302241 |
7 | 11044132255036 |
oct | 1502541021661 |
9 | 351146408647 |
10 | 112030131121 |
11 | 4356a0a7727 |
12 | 198667b7981 |
13 | a744c93b1c |
14 | 55caa8338d |
15 | 2daa45cdd1 |
hex | 1a158423b1 |
112030131121 has 8 divisors (see below), whose sum is σ = 118938162024. Its totient is φ = 105157436160.
The previous prime is 112030131089. The next prime is 112030131139. The reversal of 112030131121 is 121131030211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 59872706721 + 52157424400 = 244689^2 + 228380^2 .
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 112030131121 - 25 = 112030131089 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112030131095 and 112030131104.
It is not an unprimeable number, because it can be changed into a prime (112030131821) 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, 8827450 + ... + 8840131.
It is an arithmetic number, because the mean of its divisors is an integer number (14867270253).
Almost surely, 2112030131121 is an apocalyptic number.
It is an amenable number.
112030131121 is a deficient number, since it is larger than the sum of its proper divisors (6908030903).
112030131121 is a wasteful number, since it uses less digits than its factorization.
112030131121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17667971.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 112030131121 its reverse (121131030211), we get a palindrome (233161161332).
The spelling of 112030131121 in words is "one hundred twelve billion, thirty million, one hundred thirty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •