Base | Representation |
---|---|
bin | 10110100011111000… |
… | …00010011000000111 |
3 | 1011021010001222212211 |
4 | 23101330002120013 |
5 | 144301200023421 |
6 | 5321512324251 |
7 | 606102150202 |
oct | 132174023007 |
9 | 34233058784 |
10 | 12112111111 |
11 | 5155a75391 |
12 | 24203a3687 |
13 | 11b0458a69 |
14 | 82c882939 |
15 | 4ad5189e1 |
hex | 2d1f02607 |
12112111111 has 4 divisors (see below), whose sum is σ = 12112597800. Its totient is φ = 12111624424.
The previous prime is 12112110943. The next prime is 12112111133. The reversal of 12112111111 is 11111121121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12112111111 is a prime.
It is a Duffinian number.
12112111111 is a modest number, since divided by 111111 gives 12112 as remainder.
It is a junction number, because it is equal to n+sod(n) for n = 12112111091 and 12112111100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112111411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 203881 + ... + 256498.
It is an arithmetic number, because the mean of its divisors is an integer number (3028149450).
Almost surely, 212112111111 is an apocalyptic number.
12112111111 is a deficient number, since it is larger than the sum of its proper divisors (486689).
12112111111 is an equidigital number, since it uses as much as digits as its factorization.
12112111111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 486688.
The product of its digits is 4, while the sum is 13.
Adding to 12112111111 its reverse (11111121121), we get a palindrome (23223232232).
It can be divided in two parts, 121121 and 11111, that multiplied together give a palindrome (1345775431).
The spelling of 12112111111 in words is "twelve billion, one hundred twelve million, one hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •