Base | Representation |
---|---|
bin | 11110101111000100110… |
… | …100110100000000111011 |
3 | 21110220210001100000001101 |
4 | 132233010310310000323 |
5 | 234101121031334321 |
6 | 4254144420032231 |
7 | 305411402210626 |
oct | 36570464640073 |
9 | 7426701300041 |
10 | 2112131121211 |
11 | 744827a558a1 |
12 | 2a1418532677 |
13 | 124233427537 |
14 | 74328b00dbd |
15 | 39e1c238791 |
hex | 1ebc4d3403b |
2112131121211 has 2 divisors, whose sum is σ = 2112131121212. Its totient is φ = 2112131121210.
The previous prime is 2112131121209. The next prime is 2112131121259. The reversal of 2112131121211 is 1121211312112.
It is a m-pointer prime, because the next prime (2112131121259) can be obtained adding 2112131121211 to its product of digits (48).
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2112131121211 - 21 = 2112131121209 is a prime.
It is a super-2 number, since 2×21121311212112 (a number of 25 digits) contains 22 as substring.
Together with 2112131121209, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2112131121011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056065560605 + 1056065560606.
It is an arithmetic number, because the mean of its divisors is an integer number (1056065560606).
Almost surely, 22112131121211 is an apocalyptic number.
2112131121211 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112131121211 is an equidigital number, since it uses as much as digits as its factorization.
2112131121211 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 48, while the sum is 19.
Adding to 2112131121211 its reverse (1121211312112), we get a palindrome (3233342433323).
The spelling of 2112131121211 in words is "two trillion, one hundred twelve billion, one hundred thirty-one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •