Base | Representation |
---|---|
bin | 111011111101110… |
… | …0110000100010001 |
3 | 12012020010211120010 |
4 | 1313323212010101 |
5 | 13110100023441 |
6 | 531354305133 |
7 | 100601443116 |
oct | 16773460421 |
9 | 5166124503 |
10 | 2012111121 |
11 | 942869959 |
12 | 481a281a9 |
13 | 260b27ac7 |
14 | 15132c90d |
15 | bb9a6116 |
hex | 77ee6111 |
2012111121 has 8 divisors (see below), whose sum is σ = 2748249504. Its totient is φ = 1308690080.
The previous prime is 2012111113. The next prime is 2012111131. The reversal of 2012111121 is 1211112102.
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 2012111121 - 23 = 2012111113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2012111097 and 2012111106.
It is not an unprimeable number, because it can be changed into a prime (2012111111) 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 7 ways as a sum of consecutive naturals, for example, 8179191 + ... + 8179436.
It is an arithmetic number, because the mean of its divisors is an integer number (343531188).
Almost surely, 22012111121 is an apocalyptic number.
It is an amenable number.
2012111121 is a deficient number, since it is larger than the sum of its proper divisors (736138383).
2012111121 is a wasteful number, since it uses less digits than its factorization.
2012111121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16358671.
The product of its (nonzero) digits is 8, while the sum is 12.
The square root of 2012111121 is about 44856.5616270351. The cubic root of 2012111121 is about 1262.4591096909.
Adding to 2012111121 its reverse (1211112102), we get a palindrome (3223223223).
The spelling of 2012111121 in words is "two billion, twelve million, one hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •