Base | Representation |
---|---|
bin | 10011001110110110001… |
… | …010010010111010101111 |
3 | 11200100022100110200210211 |
4 | 103032312022102322233 |
5 | 133123124421041421 |
6 | 2451050104443251 |
7 | 164324520046213 |
oct | 23166612227257 |
9 | 4610270420724 |
10 | 1321611112111 |
11 | 46a546022624 |
12 | 194178a79527 |
13 | 978204c8944 |
14 | 47d75818943 |
15 | 245a13379e1 |
hex | 133b6292eaf |
1321611112111 has 2 divisors, whose sum is σ = 1321611112112. Its totient is φ = 1321611112110.
The previous prime is 1321611112109. The next prime is 1321611112183. The reversal of 1321611112111 is 1112111161231.
It is a m-pointer prime, because the next prime (1321611112183) can be obtained adding 1321611112111 to its product of digits (72).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1321611112111 - 21 = 1321611112109 is a prime.
Together with 1321611112109, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1321611812111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 660805556055 + 660805556056.
It is an arithmetic number, because the mean of its divisors is an integer number (660805556056).
Almost surely, 21321611112111 is an apocalyptic number.
1321611112111 is a deficient number, since it is larger than the sum of its proper divisors (1).
1321611112111 is an equidigital number, since it uses as much as digits as its factorization.
1321611112111 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 72, while the sum is 22.
Adding to 1321611112111 its reverse (1112111161231), we get a palindrome (2433722273342).
The spelling of 1321611112111 in words is "one trillion, three hundred twenty-one billion, six hundred eleven million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •