Base | Representation |
---|---|
bin | 110100001101001100… |
… | …1110011010100100001 |
3 | 101201101021201211212021 |
4 | 1220122121303110201 |
5 | 3314101200333441 |
6 | 123300435501441 |
7 | 11046146206660 |
oct | 1503231632441 |
9 | 351337654767 |
10 | 112112121121 |
11 | 43601407a60 |
12 | 1988a157881 |
13 | a758c6cc10 |
14 | 55d7906dd7 |
15 | 2db27563d1 |
hex | 1a1a673521 |
112112121121 has 32 divisors (see below), whose sum is σ = 151369344000. Its totient is φ = 80189455680.
The previous prime is 112112121109. The next prime is 112112121151. The reversal of 112112121121 is 121121211211.
It is a cyclic number.
It is not a de Polignac number, because 112112121121 - 223 = 112103732513 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112112121095 and 112112121104.
It is not an unprimeable number, because it can be changed into a prime (112112121151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 133671 + ... + 492028.
It is an arithmetic number, because the mean of its divisors is an integer number (4730292000).
Almost surely, 2112112121121 is an apocalyptic number.
112112121121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112112121121 is a deficient number, since it is larger than the sum of its proper divisors (39257222879).
112112121121 is a wasteful number, since it uses less digits than its factorization.
112112121121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 625909.
The product of its digits is 16, while the sum is 16.
Adding to 112112121121 its reverse (121121211211), we get a palindrome (233233332332).
The spelling of 112112121121 in words is "one hundred twelve billion, one hundred twelve million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •