Base | Representation |
---|---|
bin | 111110100111111… |
… | …0111101001101111 |
3 | 12102102222201022111 |
4 | 1331033313221233 |
5 | 13300413441421 |
6 | 544302224451 |
7 | 103033600243 |
oct | 17517675157 |
9 | 5372881274 |
10 | 2101312111 |
11 | 989154988 |
12 | 4a7885127 |
13 | 27645a162 |
14 | 15d10c423 |
15 | c4725ee1 |
hex | 7d3f7a6f |
2101312111 has 2 divisors, whose sum is σ = 2101312112. Its totient is φ = 2101312110.
The previous prime is 2101312093. The next prime is 2101312127. The reversal of 2101312111 is 1112131012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2101312111 - 215 = 2101279343 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2101312091 and 2101312100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2101312151) 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, 1050656055 + 1050656056.
It is an arithmetic number, because the mean of its divisors is an integer number (1050656056).
Almost surely, 22101312111 is an apocalyptic number.
2101312111 is a deficient number, since it is larger than the sum of its proper divisors (1).
2101312111 is an equidigital number, since it uses as much as digits as its factorization.
2101312111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 2101312111 is about 45840.0710187059. The cubic root of 2101312111 is about 1280.8458177144.
Adding to 2101312111 its reverse (1112131012), we get a palindrome (3213443123).
It can be divided in two parts, 21013 and 12111, that added together give a square (33124 = 1822).
The spelling of 2101312111 in words is "two billion, one hundred one million, three hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •