Base | Representation |
---|---|
bin | 1011000000111100111111… |
… | …1111000001011100001111 |
3 | 1120212210121120022201201121 |
4 | 2300033033333001130033 |
5 | 3041411313031241421 |
6 | 41431415000421411 |
7 | 2356663632156115 |
oct | 260171777013417 |
9 | 46783546281647 |
10 | 12111002212111 |
11 | 394a27a019790 |
12 | 143723a177867 |
13 | 69b0a771c7ba |
14 | 2dc265d27ab5 |
15 | 16007ced4d41 |
hex | b03cffc170f |
12111002212111 has 4 divisors (see below), whose sum is σ = 13212002413224. Its totient is φ = 11010002011000.
The previous prime is 12111002212061. The next prime is 12111002212117. The reversal of 12111002212111 is 11121220011121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12111002212111 - 221 = 12111000114959 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12111002212117) 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, 550500100540 + ... + 550500100561.
It is an arithmetic number, because the mean of its divisors is an integer number (3303000603306).
Almost surely, 212111002212111 is an apocalyptic number.
12111002212111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
12111002212111 is a deficient number, since it is larger than the sum of its proper divisors (1101000201113).
12111002212111 is a wasteful number, since it uses less digits than its factorization.
12111002212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1101000201112.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12111002212111 its reverse (11121220011121), we get a palindrome (23232222223232).
The spelling of 12111002212111 in words is "twelve trillion, one hundred eleven billion, two million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •