Base | Representation |
---|---|
bin | 1011000001000000110000… |
… | …1011110111001110100111 |
3 | 1120212220012221210222212222 |
4 | 2300100030023313032213 |
5 | 3041420400111223421 |
6 | 41432103120302555 |
7 | 2360030645053451 |
oct | 260201413671647 |
9 | 46786187728788 |
10 | 12112012211111 |
11 | 394a7481519aa |
12 | 1437480471a5b |
13 | 69b208a4ac47 |
14 | 2dc3201192d1 |
15 | 1600db9ddcab |
hex | b040c2f73a7 |
12112012211111 has 8 divisors (see below), whose sum is σ = 12135846193680. Its totient is φ = 12088180806912.
The previous prime is 12112012211077. The next prime is 12112012211161. The reversal of 12112012211111 is 11111221021121.
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 12112012211111 - 210 = 12112012210087 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12112012211111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12112012211161) 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, 8898551 + ... + 10168983.
It is an arithmetic number, because the mean of its divisors is an integer number (1516980774210).
Almost surely, 212112012211111 is an apocalyptic number.
12112012211111 is a deficient number, since it is larger than the sum of its proper divisors (23833982569).
12112012211111 is a wasteful number, since it uses less digits than its factorization.
12112012211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1289185.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 12112012211111 its reverse (11111221021121), we get a palindrome (23223233232232).
The spelling of 12112012211111 in words is "twelve trillion, one hundred twelve billion, twelve million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •